./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:30:24,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:30:24,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:30:24,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:30:24,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:30:24,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:30:24,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:30:24,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:30:24,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:30:24,148 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:30:24,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:30:24,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:30:24,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:30:24,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:30:24,150 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:30:24,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:30:24,152 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:30:24,152 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:30:24,153 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:30:24,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:30:24,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:30:24,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:30:24,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:30:24,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:30:24,158 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:30:24,159 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:30:24,159 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:30:24,159 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:30:24,159 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:30:24,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:30:24,159 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:30:24,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:30:24,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:30:24,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:30:24,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:30:24,160 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:30:24,160 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:30:24,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:30:24,160 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:30:24,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:30:24,161 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:30:24,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:30:24,162 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2024-11-09 18:30:24,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:30:24,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:30:24,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:30:24,378 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:30:24,378 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:30:24,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2024-11-09 18:30:25,769 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:30:25,904 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:30:25,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2024-11-09 18:30:25,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08eaee580/cd48a52776d449ea81ae23a547476cfe/FLAG352f2fa64 [2024-11-09 18:30:25,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08eaee580/cd48a52776d449ea81ae23a547476cfe [2024-11-09 18:30:25,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:30:25,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:30:25,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:30:25,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:30:25,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:30:25,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:30:25" (1/1) ... [2024-11-09 18:30:25,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ae0fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:25, skipping insertion in model container [2024-11-09 18:30:25,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:30:25" (1/1) ... [2024-11-09 18:30:25,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:30:26,077 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2024-11-09 18:30:26,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:30:26,142 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:30:26,154 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2024-11-09 18:30:26,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:30:26,201 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:30:26,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:26 WrapperNode [2024-11-09 18:30:26,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:30:26,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:30:26,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:30:26,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:30:26,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:26" (1/1) ... [2024-11-09 18:30:26,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:26" (1/1) ... [2024-11-09 18:30:26,248 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 145 [2024-11-09 18:30:26,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:30:26,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:30:26,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:30:26,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:30:26,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:26" (1/1) ... [2024-11-09 18:30:26,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:26" (1/1) ... [2024-11-09 18:30:26,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:26" (1/1) ... [2024-11-09 18:30:26,309 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 18:30:26,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:26" (1/1) ... [2024-11-09 18:30:26,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:26" (1/1) ... [2024-11-09 18:30:26,316 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:26" (1/1) ... [2024-11-09 18:30:26,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:26" (1/1) ... [2024-11-09 18:30:26,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:26" (1/1) ... [2024-11-09 18:30:26,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:26" (1/1) ... [2024-11-09 18:30:26,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:30:26,321 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:30:26,321 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:30:26,321 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:30:26,322 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:26" (1/1) ... [2024-11-09 18:30:26,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:30:26,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:30:26,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 18:30:26,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 18:30:26,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:30:26,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:30:26,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:30:26,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:30:26,475 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:30:26,478 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:30:26,750 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-09 18:30:26,750 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:30:26,772 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:30:26,772 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:30:26,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:30:26 BoogieIcfgContainer [2024-11-09 18:30:26,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:30:26,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:30:26,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:30:26,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:30:26,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:30:25" (1/3) ... [2024-11-09 18:30:26,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d65a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:30:26, skipping insertion in model container [2024-11-09 18:30:26,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:26" (2/3) ... [2024-11-09 18:30:26,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d65a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:30:26, skipping insertion in model container [2024-11-09 18:30:26,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:30:26" (3/3) ... [2024-11-09 18:30:26,781 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2024-11-09 18:30:26,793 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:30:26,794 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:30:26,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:30:26,857 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2060df39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:30:26,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:30:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 53 states have (on average 1.6981132075471699) internal successors, (90), 54 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:26,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 18:30:26,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:26,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:26,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:26,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:26,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1298272773, now seen corresponding path program 1 times [2024-11-09 18:30:26,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:26,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814747202] [2024-11-09 18:30:26,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:26,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:27,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:30:27,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:27,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814747202] [2024-11-09 18:30:27,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814747202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:27,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:27,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:30:27,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462856953] [2024-11-09 18:30:27,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:27,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 18:30:27,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:27,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 18:30:27,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 18:30:27,081 INFO L87 Difference]: Start difference. First operand has 55 states, 53 states have (on average 1.6981132075471699) internal successors, (90), 54 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:27,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:27,105 INFO L93 Difference]: Finished difference Result 81 states and 128 transitions. [2024-11-09 18:30:27,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 18:30:27,107 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 18:30:27,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:27,113 INFO L225 Difference]: With dead ends: 81 [2024-11-09 18:30:27,113 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 18:30:27,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 18:30:27,117 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:27,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:30:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 18:30:27,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 18:30:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 49 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 82 transitions. [2024-11-09 18:30:27,147 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 82 transitions. Word has length 16 [2024-11-09 18:30:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:27,148 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 82 transitions. [2024-11-09 18:30:27,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 82 transitions. [2024-11-09 18:30:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 18:30:27,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:27,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:27,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:30:27,150 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:27,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:27,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1604235013, now seen corresponding path program 1 times [2024-11-09 18:30:27,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:27,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105766296] [2024-11-09 18:30:27,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:27,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:27,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:30:27,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:27,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105766296] [2024-11-09 18:30:27,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105766296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:27,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:27,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:30:27,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692876573] [2024-11-09 18:30:27,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:27,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:30:27,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:27,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:30:27,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:30:27,298 INFO L87 Difference]: Start difference. First operand 50 states and 82 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:27,435 INFO L93 Difference]: Finished difference Result 115 states and 194 transitions. [2024-11-09 18:30:27,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:30:27,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 18:30:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:27,437 INFO L225 Difference]: With dead ends: 115 [2024-11-09 18:30:27,437 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 18:30:27,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:30:27,439 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 24 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:27,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 88 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:30:27,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 18:30:27,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2024-11-09 18:30:27,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 72 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:27,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2024-11-09 18:30:27,446 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 18 [2024-11-09 18:30:27,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:27,446 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2024-11-09 18:30:27,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2024-11-09 18:30:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 18:30:27,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:27,448 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:27,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:30:27,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:27,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:27,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1524064198, now seen corresponding path program 1 times [2024-11-09 18:30:27,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:27,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562919319] [2024-11-09 18:30:27,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:27,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:27,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:30:27,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:27,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562919319] [2024-11-09 18:30:27,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562919319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:27,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:27,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:30:27,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197031721] [2024-11-09 18:30:27,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:27,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:30:27,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:27,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:30:27,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:30:27,560 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:27,749 INFO L93 Difference]: Finished difference Result 174 states and 289 transitions. [2024-11-09 18:30:27,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:30:27,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 18:30:27,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:27,750 INFO L225 Difference]: With dead ends: 174 [2024-11-09 18:30:27,751 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 18:30:27,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:30:27,752 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 96 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:27,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 116 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:30:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 18:30:27,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 98. [2024-11-09 18:30:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.5051546391752577) internal successors, (146), 97 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 146 transitions. [2024-11-09 18:30:27,760 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 146 transitions. Word has length 25 [2024-11-09 18:30:27,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:27,760 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 146 transitions. [2024-11-09 18:30:27,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:27,760 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 146 transitions. [2024-11-09 18:30:27,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 18:30:27,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:27,764 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:27,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 18:30:27,764 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:27,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:27,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1748575367, now seen corresponding path program 1 times [2024-11-09 18:30:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:27,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903532609] [2024-11-09 18:30:27,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:27,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:27,904 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 18:30:27,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:27,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903532609] [2024-11-09 18:30:27,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903532609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:27,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:27,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:30:27,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871851657] [2024-11-09 18:30:27,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:27,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:30:27,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:27,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:30:27,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:30:27,906 INFO L87 Difference]: Start difference. First operand 98 states and 146 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:28,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:28,092 INFO L93 Difference]: Finished difference Result 254 states and 377 transitions. [2024-11-09 18:30:28,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:30:28,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-09 18:30:28,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:28,093 INFO L225 Difference]: With dead ends: 254 [2024-11-09 18:30:28,095 INFO L226 Difference]: Without dead ends: 170 [2024-11-09 18:30:28,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:30:28,096 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 77 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:28,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 189 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:30:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-09 18:30:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 106. [2024-11-09 18:30:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.4952380952380953) internal successors, (157), 105 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 157 transitions. [2024-11-09 18:30:28,110 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 157 transitions. Word has length 32 [2024-11-09 18:30:28,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:28,110 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 157 transitions. [2024-11-09 18:30:28,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:28,111 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 157 transitions. [2024-11-09 18:30:28,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 18:30:28,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:28,111 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:28,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 18:30:28,112 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:28,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:28,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1525906074, now seen corresponding path program 1 times [2024-11-09 18:30:28,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:28,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928520862] [2024-11-09 18:30:28,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:28,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 18:30:28,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:28,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928520862] [2024-11-09 18:30:28,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928520862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:28,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:28,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:30:28,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397114462] [2024-11-09 18:30:28,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:28,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:30:28,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:28,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:30:28,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:30:28,239 INFO L87 Difference]: Start difference. First operand 106 states and 157 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:28,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:28,364 INFO L93 Difference]: Finished difference Result 262 states and 385 transitions. [2024-11-09 18:30:28,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:30:28,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-09 18:30:28,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:28,367 INFO L225 Difference]: With dead ends: 262 [2024-11-09 18:30:28,367 INFO L226 Difference]: Without dead ends: 178 [2024-11-09 18:30:28,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:30:28,368 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 72 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:28,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 181 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:30:28,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-09 18:30:28,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 119. [2024-11-09 18:30:28,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 118 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2024-11-09 18:30:28,383 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 33 [2024-11-09 18:30:28,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:28,383 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2024-11-09 18:30:28,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:28,383 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2024-11-09 18:30:28,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 18:30:28,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:28,385 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:28,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 18:30:28,386 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:28,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:28,386 INFO L85 PathProgramCache]: Analyzing trace with hash -526810516, now seen corresponding path program 1 times [2024-11-09 18:30:28,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:28,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863910715] [2024-11-09 18:30:28,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:28,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:30:28,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:28,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863910715] [2024-11-09 18:30:28,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863910715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:30:28,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050901706] [2024-11-09 18:30:28,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:28,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:30:28,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:30:28,499 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:30:28,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 18:30:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:28,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 18:30:28,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:28,608 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 18:30:28,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:30:28,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050901706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:28,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:30:28,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-09 18:30:28,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951156445] [2024-11-09 18:30:28,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:28,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:30:28,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:28,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:30:28,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:30:28,611 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:28,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:28,748 INFO L93 Difference]: Finished difference Result 247 states and 380 transitions. [2024-11-09 18:30:28,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:30:28,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 18:30:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:28,749 INFO L225 Difference]: With dead ends: 247 [2024-11-09 18:30:28,749 INFO L226 Difference]: Without dead ends: 166 [2024-11-09 18:30:28,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:30:28,750 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 38 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:28,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 155 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:30:28,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-09 18:30:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 150. [2024-11-09 18:30:28,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.395973154362416) internal successors, (208), 149 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 208 transitions. [2024-11-09 18:30:28,757 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 208 transitions. Word has length 34 [2024-11-09 18:30:28,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:28,758 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 208 transitions. [2024-11-09 18:30:28,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:28,758 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 208 transitions. [2024-11-09 18:30:28,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 18:30:28,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:28,759 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:28,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 18:30:28,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 18:30:28,960 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:28,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:28,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2072682047, now seen corresponding path program 1 times [2024-11-09 18:30:28,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:28,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599214391] [2024-11-09 18:30:28,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:28,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:29,059 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:30:29,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:29,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599214391] [2024-11-09 18:30:29,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599214391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:30:29,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419988223] [2024-11-09 18:30:29,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:29,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:30:29,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:30:29,062 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:30:29,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 18:30:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:29,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 18:30:29,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 18:30:29,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:30:29,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419988223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:29,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:30:29,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-09 18:30:29,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550375542] [2024-11-09 18:30:29,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:29,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:30:29,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:29,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:30:29,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:30:29,135 INFO L87 Difference]: Start difference. First operand 150 states and 208 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:29,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:29,268 INFO L93 Difference]: Finished difference Result 309 states and 448 transitions. [2024-11-09 18:30:29,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:30:29,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-09 18:30:29,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:29,270 INFO L225 Difference]: With dead ends: 309 [2024-11-09 18:30:29,270 INFO L226 Difference]: Without dead ends: 197 [2024-11-09 18:30:29,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:30:29,271 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 37 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:29,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 155 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:30:29,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-09 18:30:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 175. [2024-11-09 18:30:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.3620689655172413) internal successors, (237), 174 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 237 transitions. [2024-11-09 18:30:29,278 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 237 transitions. Word has length 41 [2024-11-09 18:30:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:29,278 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 237 transitions. [2024-11-09 18:30:29,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 237 transitions. [2024-11-09 18:30:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 18:30:29,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:29,280 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:29,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 18:30:29,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 18:30:29,485 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:29,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:29,486 INFO L85 PathProgramCache]: Analyzing trace with hash 614367278, now seen corresponding path program 1 times [2024-11-09 18:30:29,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:29,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652593366] [2024-11-09 18:30:29,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:29,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-09 18:30:29,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:29,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652593366] [2024-11-09 18:30:29,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652593366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:29,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:29,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 18:30:29,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448137784] [2024-11-09 18:30:29,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:29,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:30:29,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:29,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:30:29,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:30:29,567 INFO L87 Difference]: Start difference. First operand 175 states and 237 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:29,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:29,751 INFO L93 Difference]: Finished difference Result 550 states and 748 transitions. [2024-11-09 18:30:29,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:30:29,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-09 18:30:29,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:29,753 INFO L225 Difference]: With dead ends: 550 [2024-11-09 18:30:29,753 INFO L226 Difference]: Without dead ends: 409 [2024-11-09 18:30:29,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:30:29,754 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 156 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:29,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 310 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:30:29,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-09 18:30:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 175. [2024-11-09 18:30:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.3620689655172413) internal successors, (237), 174 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:29,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 237 transitions. [2024-11-09 18:30:29,769 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 237 transitions. Word has length 48 [2024-11-09 18:30:29,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:29,770 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 237 transitions. [2024-11-09 18:30:29,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:29,770 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 237 transitions. [2024-11-09 18:30:29,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 18:30:29,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:29,771 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:29,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 18:30:29,772 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:29,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:29,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2100823158, now seen corresponding path program 1 times [2024-11-09 18:30:29,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:29,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051376608] [2024-11-09 18:30:29,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:29,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-09 18:30:29,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:29,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051376608] [2024-11-09 18:30:29,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051376608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:29,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:29,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 18:30:29,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25249401] [2024-11-09 18:30:29,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:29,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:30:29,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:29,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:30:29,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:30:29,849 INFO L87 Difference]: Start difference. First operand 175 states and 237 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:30,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:30,065 INFO L93 Difference]: Finished difference Result 530 states and 723 transitions. [2024-11-09 18:30:30,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:30:30,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-09 18:30:30,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:30,067 INFO L225 Difference]: With dead ends: 530 [2024-11-09 18:30:30,067 INFO L226 Difference]: Without dead ends: 390 [2024-11-09 18:30:30,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:30:30,068 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 145 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:30,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 275 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:30:30,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-09 18:30:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 175. [2024-11-09 18:30:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.3620689655172413) internal successors, (237), 174 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:30,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 237 transitions. [2024-11-09 18:30:30,081 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 237 transitions. Word has length 49 [2024-11-09 18:30:30,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:30,081 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 237 transitions. [2024-11-09 18:30:30,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:30,081 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 237 transitions. [2024-11-09 18:30:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 18:30:30,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:30,083 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:30,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 18:30:30,083 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:30,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:30,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1575393489, now seen corresponding path program 1 times [2024-11-09 18:30:30,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:30,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873487950] [2024-11-09 18:30:30,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:30,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-09 18:30:30,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:30,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873487950] [2024-11-09 18:30:30,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873487950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:30,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:30,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:30:30,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943549676] [2024-11-09 18:30:30,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:30,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:30:30,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:30,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:30:30,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:30:30,215 INFO L87 Difference]: Start difference. First operand 175 states and 237 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:30,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:30,230 INFO L93 Difference]: Finished difference Result 330 states and 445 transitions. [2024-11-09 18:30:30,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:30:30,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-09 18:30:30,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:30,231 INFO L225 Difference]: With dead ends: 330 [2024-11-09 18:30:30,232 INFO L226 Difference]: Without dead ends: 158 [2024-11-09 18:30:30,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:30:30,233 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 71 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:30,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:30:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-09 18:30:30,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-09 18:30:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.3439490445859872) internal successors, (211), 157 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 211 transitions. [2024-11-09 18:30:30,239 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 211 transitions. Word has length 50 [2024-11-09 18:30:30,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:30,239 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 211 transitions. [2024-11-09 18:30:30,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:30,239 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 211 transitions. [2024-11-09 18:30:30,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 18:30:30,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:30,240 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:30,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 18:30:30,241 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:30,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:30,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2052119436, now seen corresponding path program 1 times [2024-11-09 18:30:30,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:30,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334745044] [2024-11-09 18:30:30,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:30,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 18:30:30,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:30,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334745044] [2024-11-09 18:30:30,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334745044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:30,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:30,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:30:30,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276466862] [2024-11-09 18:30:30,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:30,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:30:30,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:30,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:30:30,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:30:30,296 INFO L87 Difference]: Start difference. First operand 158 states and 211 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:30,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:30,320 INFO L93 Difference]: Finished difference Result 238 states and 313 transitions. [2024-11-09 18:30:30,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:30:30,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-09 18:30:30,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:30,322 INFO L225 Difference]: With dead ends: 238 [2024-11-09 18:30:30,322 INFO L226 Difference]: Without dead ends: 192 [2024-11-09 18:30:30,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:30:30,323 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:30,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 143 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:30:30,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-09 18:30:30,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-11-09 18:30:30,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.3141361256544504) internal successors, (251), 191 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:30,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 251 transitions. [2024-11-09 18:30:30,328 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 251 transitions. Word has length 55 [2024-11-09 18:30:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:30,331 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 251 transitions. [2024-11-09 18:30:30,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 251 transitions. [2024-11-09 18:30:30,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 18:30:30,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:30,332 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:30,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 18:30:30,332 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:30,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:30,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1320164277, now seen corresponding path program 1 times [2024-11-09 18:30:30,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:30,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874606265] [2024-11-09 18:30:30,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:30,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 18:30:30,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:30,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874606265] [2024-11-09 18:30:30,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874606265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:30:30,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869305844] [2024-11-09 18:30:30,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:30,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:30:30,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:30:30,517 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:30:30,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 18:30:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:30,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 18:30:30,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 18:30:30,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:30:30,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869305844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:30,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:30:30,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-11-09 18:30:30,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722102624] [2024-11-09 18:30:30,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:30,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:30:30,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:30,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:30:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:30:30,647 INFO L87 Difference]: Start difference. First operand 192 states and 251 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:30,717 INFO L93 Difference]: Finished difference Result 392 states and 520 transitions. [2024-11-09 18:30:30,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:30:30,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-09 18:30:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:30,720 INFO L225 Difference]: With dead ends: 392 [2024-11-09 18:30:30,721 INFO L226 Difference]: Without dead ends: 183 [2024-11-09 18:30:30,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:30:30,721 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 36 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:30,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 105 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:30:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-09 18:30:30,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 151. [2024-11-09 18:30:30,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.2866666666666666) internal successors, (193), 150 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 193 transitions. [2024-11-09 18:30:30,730 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 193 transitions. Word has length 55 [2024-11-09 18:30:30,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:30,730 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 193 transitions. [2024-11-09 18:30:30,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:30,730 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 193 transitions. [2024-11-09 18:30:30,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 18:30:30,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:30,734 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:30,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 18:30:30,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:30:30,935 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:30,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:30,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1623155685, now seen corresponding path program 1 times [2024-11-09 18:30:30,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:30,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996030713] [2024-11-09 18:30:30,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:30,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-09 18:30:31,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:31,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996030713] [2024-11-09 18:30:31,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996030713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:31,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:31,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 18:30:31,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519651103] [2024-11-09 18:30:31,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:31,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:30:31,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:31,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:30:31,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:30:31,116 INFO L87 Difference]: Start difference. First operand 151 states and 193 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:31,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:31,256 INFO L93 Difference]: Finished difference Result 464 states and 600 transitions. [2024-11-09 18:30:31,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 18:30:31,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-09 18:30:31,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:31,257 INFO L225 Difference]: With dead ends: 464 [2024-11-09 18:30:31,257 INFO L226 Difference]: Without dead ends: 334 [2024-11-09 18:30:31,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:30:31,258 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 161 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:31,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 208 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:30:31,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-09 18:30:31,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 233. [2024-11-09 18:30:31,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.2887931034482758) internal successors, (299), 232 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 299 transitions. [2024-11-09 18:30:31,266 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 299 transitions. Word has length 76 [2024-11-09 18:30:31,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:31,266 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 299 transitions. [2024-11-09 18:30:31,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:31,266 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 299 transitions. [2024-11-09 18:30:31,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 18:30:31,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:31,267 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:31,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 18:30:31,267 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:31,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:31,267 INFO L85 PathProgramCache]: Analyzing trace with hash -420727560, now seen corresponding path program 1 times [2024-11-09 18:30:31,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:31,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477717672] [2024-11-09 18:30:31,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:31,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 18:30:31,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:31,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477717672] [2024-11-09 18:30:31,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477717672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:30:31,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453928627] [2024-11-09 18:30:31,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:31,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:30:31,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:30:31,576 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:30:31,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 18:30:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:31,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 18:30:31,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 18:30:31,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:30:31,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453928627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:31,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:30:31,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-09 18:30:31,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196577689] [2024-11-09 18:30:31,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:31,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 18:30:31,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:31,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 18:30:31,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 18:30:31,753 INFO L87 Difference]: Start difference. First operand 233 states and 299 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:31,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:31,859 INFO L93 Difference]: Finished difference Result 1032 states and 1328 transitions. [2024-11-09 18:30:31,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 18:30:31,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-09 18:30:31,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:31,862 INFO L225 Difference]: With dead ends: 1032 [2024-11-09 18:30:31,862 INFO L226 Difference]: Without dead ends: 815 [2024-11-09 18:30:31,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 18:30:31,863 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 152 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:31,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 542 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:30:31,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2024-11-09 18:30:31,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 397. [2024-11-09 18:30:31,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.2626262626262625) internal successors, (500), 396 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:31,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 500 transitions. [2024-11-09 18:30:31,875 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 500 transitions. Word has length 76 [2024-11-09 18:30:31,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:31,875 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 500 transitions. [2024-11-09 18:30:31,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 500 transitions. [2024-11-09 18:30:31,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 18:30:31,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:31,876 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:31,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 18:30:32,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:30:32,078 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:32,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:32,079 INFO L85 PathProgramCache]: Analyzing trace with hash 533501335, now seen corresponding path program 1 times [2024-11-09 18:30:32,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:32,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115163202] [2024-11-09 18:30:32,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:32,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 18:30:32,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:32,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115163202] [2024-11-09 18:30:32,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115163202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:32,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:32,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 18:30:32,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510187882] [2024-11-09 18:30:32,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:32,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:30:32,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:32,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:30:32,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:30:32,253 INFO L87 Difference]: Start difference. First operand 397 states and 500 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:32,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:32,485 INFO L93 Difference]: Finished difference Result 1057 states and 1343 transitions. [2024-11-09 18:30:32,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 18:30:32,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-09 18:30:32,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:32,490 INFO L225 Difference]: With dead ends: 1057 [2024-11-09 18:30:32,490 INFO L226 Difference]: Without dead ends: 845 [2024-11-09 18:30:32,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 18:30:32,491 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 194 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:32,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 279 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:30:32,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-11-09 18:30:32,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 392. [2024-11-09 18:30:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.2659846547314577) internal successors, (495), 391 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:32,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 495 transitions. [2024-11-09 18:30:32,505 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 495 transitions. Word has length 76 [2024-11-09 18:30:32,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:32,505 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 495 transitions. [2024-11-09 18:30:32,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:32,506 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 495 transitions. [2024-11-09 18:30:32,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 18:30:32,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:32,507 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:32,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 18:30:32,507 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:32,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:32,507 INFO L85 PathProgramCache]: Analyzing trace with hash -67122028, now seen corresponding path program 1 times [2024-11-09 18:30:32,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:32,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898869560] [2024-11-09 18:30:32,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:32,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 18:30:32,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:32,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898869560] [2024-11-09 18:30:32,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898869560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:30:32,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231936930] [2024-11-09 18:30:32,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:32,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:30:32,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:30:32,615 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:30:32,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 18:30:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:32,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 18:30:32,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:32,726 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 18:30:32,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:30:32,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231936930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:32,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:30:32,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-09 18:30:32,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755846231] [2024-11-09 18:30:32,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:32,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:30:32,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:32,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:30:32,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:30:32,731 INFO L87 Difference]: Start difference. First operand 392 states and 495 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:32,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:32,864 INFO L93 Difference]: Finished difference Result 824 states and 1050 transitions. [2024-11-09 18:30:32,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:30:32,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-09 18:30:32,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:32,869 INFO L225 Difference]: With dead ends: 824 [2024-11-09 18:30:32,869 INFO L226 Difference]: Without dead ends: 612 [2024-11-09 18:30:32,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:30:32,870 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 31 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:32,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 131 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:30:32,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-09 18:30:32,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 588. [2024-11-09 18:30:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 587 states have (on average 1.2708688245315163) internal successors, (746), 587 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 746 transitions. [2024-11-09 18:30:32,906 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 746 transitions. Word has length 78 [2024-11-09 18:30:32,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:32,906 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 746 transitions. [2024-11-09 18:30:32,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:32,906 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 746 transitions. [2024-11-09 18:30:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 18:30:32,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:32,907 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:32,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 18:30:33,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 18:30:33,112 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:33,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:33,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1065746552, now seen corresponding path program 1 times [2024-11-09 18:30:33,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:33,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412367860] [2024-11-09 18:30:33,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:33,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:33,294 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 54 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 18:30:33,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:33,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412367860] [2024-11-09 18:30:33,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412367860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:30:33,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193181634] [2024-11-09 18:30:33,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:33,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:30:33,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:30:33,296 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:30:33,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 18:30:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:33,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 18:30:33,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 18:30:33,402 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:30:33,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193181634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:33,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:30:33,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-09 18:30:33,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307471172] [2024-11-09 18:30:33,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:33,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:30:33,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:33,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:30:33,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 18:30:33,403 INFO L87 Difference]: Start difference. First operand 588 states and 746 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:33,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:33,512 INFO L93 Difference]: Finished difference Result 1020 states and 1301 transitions. [2024-11-09 18:30:33,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:30:33,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-09 18:30:33,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:33,514 INFO L225 Difference]: With dead ends: 1020 [2024-11-09 18:30:33,514 INFO L226 Difference]: Without dead ends: 808 [2024-11-09 18:30:33,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 18:30:33,514 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 66 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:33,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 211 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:30:33,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-09 18:30:33,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 588. [2024-11-09 18:30:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 587 states have (on average 1.2708688245315163) internal successors, (746), 587 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 746 transitions. [2024-11-09 18:30:33,531 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 746 transitions. Word has length 79 [2024-11-09 18:30:33,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:33,531 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 746 transitions. [2024-11-09 18:30:33,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 746 transitions. [2024-11-09 18:30:33,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 18:30:33,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:33,532 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:33,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 18:30:33,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 18:30:33,733 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:33,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:33,733 INFO L85 PathProgramCache]: Analyzing trace with hash 494099895, now seen corresponding path program 1 times [2024-11-09 18:30:33,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:33,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31946016] [2024-11-09 18:30:33,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:33,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:34,104 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 75 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 18:30:34,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:34,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31946016] [2024-11-09 18:30:34,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31946016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:30:34,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543286936] [2024-11-09 18:30:34,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:34,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:30:34,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:30:34,106 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:30:34,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 18:30:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:34,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 18:30:34,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:34,407 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 70 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 18:30:34,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:30:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 53 proven. 23 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 18:30:34,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543286936] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:30:34,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:30:34,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 17 [2024-11-09 18:30:34,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171666694] [2024-11-09 18:30:34,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:30:34,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 18:30:34,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:34,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 18:30:34,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-11-09 18:30:34,538 INFO L87 Difference]: Start difference. First operand 588 states and 746 transitions. Second operand has 17 states, 17 states have (on average 9.529411764705882) internal successors, (162), 17 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:34,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:34,945 INFO L93 Difference]: Finished difference Result 1347 states and 1711 transitions. [2024-11-09 18:30:34,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 18:30:34,945 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.529411764705882) internal successors, (162), 17 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-09 18:30:34,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:34,947 INFO L225 Difference]: With dead ends: 1347 [2024-11-09 18:30:34,947 INFO L226 Difference]: Without dead ends: 785 [2024-11-09 18:30:34,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2024-11-09 18:30:34,948 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 426 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:34,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 729 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:30:34,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-09 18:30:34,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 474. [2024-11-09 18:30:34,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 1.2832980972515857) internal successors, (607), 473 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:34,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 607 transitions. [2024-11-09 18:30:34,969 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 607 transitions. Word has length 80 [2024-11-09 18:30:34,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:34,969 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 607 transitions. [2024-11-09 18:30:34,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.529411764705882) internal successors, (162), 17 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:34,969 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 607 transitions. [2024-11-09 18:30:34,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 18:30:34,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:34,970 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:34,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 18:30:35,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:30:35,175 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:35,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:35,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1595616053, now seen corresponding path program 2 times [2024-11-09 18:30:35,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:35,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601546141] [2024-11-09 18:30:35,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:35,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 5 proven. 82 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 18:30:35,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:35,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601546141] [2024-11-09 18:30:35,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601546141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:30:35,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481725182] [2024-11-09 18:30:35,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 18:30:35,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:30:35,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:30:35,547 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:30:35,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 18:30:35,662 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 18:30:35,662 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:30:35,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 18:30:35,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:35,855 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 29 proven. 39 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 18:30:35,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:30:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 29 proven. 39 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 18:30:36,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481725182] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:30:36,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:30:36,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2024-11-09 18:30:36,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017034549] [2024-11-09 18:30:36,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:30:36,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 18:30:36,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:36,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 18:30:36,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-11-09 18:30:36,245 INFO L87 Difference]: Start difference. First operand 474 states and 607 transitions. Second operand has 21 states, 21 states have (on average 8.428571428571429) internal successors, (177), 21 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:38,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:38,005 INFO L93 Difference]: Finished difference Result 2630 states and 3350 transitions. [2024-11-09 18:30:38,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-09 18:30:38,006 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.428571428571429) internal successors, (177), 21 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-09 18:30:38,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:38,013 INFO L225 Difference]: With dead ends: 2630 [2024-11-09 18:30:38,013 INFO L226 Difference]: Without dead ends: 2618 [2024-11-09 18:30:38,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=713, Invalid=3069, Unknown=0, NotChecked=0, Total=3782 [2024-11-09 18:30:38,015 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 567 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:38,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1599 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 18:30:38,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2024-11-09 18:30:38,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 811. [2024-11-09 18:30:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 1.325925925925926) internal successors, (1074), 810 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1074 transitions. [2024-11-09 18:30:38,075 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1074 transitions. Word has length 80 [2024-11-09 18:30:38,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:38,075 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1074 transitions. [2024-11-09 18:30:38,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.428571428571429) internal successors, (177), 21 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:38,076 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1074 transitions. [2024-11-09 18:30:38,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 18:30:38,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:38,077 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:38,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 18:30:38,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:30:38,282 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:38,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:38,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1696528020, now seen corresponding path program 1 times [2024-11-09 18:30:38,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:38,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847504964] [2024-11-09 18:30:38,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:38,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 20 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:30:38,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:38,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847504964] [2024-11-09 18:30:38,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847504964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:30:38,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560936170] [2024-11-09 18:30:38,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:38,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:30:38,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:30:38,628 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:30:38,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 18:30:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:38,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 18:30:38,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 20 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:30:38,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:30:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:30:39,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560936170] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:30:39,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:30:39,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-11-09 18:30:39,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189103407] [2024-11-09 18:30:39,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:30:39,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 18:30:39,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:39,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 18:30:39,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2024-11-09 18:30:39,122 INFO L87 Difference]: Start difference. First operand 811 states and 1074 transitions. Second operand has 20 states, 20 states have (on average 10.95) internal successors, (219), 20 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:39,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:39,913 INFO L93 Difference]: Finished difference Result 3071 states and 4025 transitions. [2024-11-09 18:30:39,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-09 18:30:39,913 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 10.95) internal successors, (219), 20 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-09 18:30:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:39,921 INFO L225 Difference]: With dead ends: 3071 [2024-11-09 18:30:39,921 INFO L226 Difference]: Without dead ends: 3062 [2024-11-09 18:30:39,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=499, Invalid=1951, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 18:30:39,925 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 412 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:39,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1208 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:30:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2024-11-09 18:30:39,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 1248. [2024-11-09 18:30:39,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1247 states have (on average 1.3817161186848437) internal successors, (1723), 1247 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:39,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1723 transitions. [2024-11-09 18:30:39,981 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1723 transitions. Word has length 80 [2024-11-09 18:30:39,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:39,981 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1723 transitions. [2024-11-09 18:30:39,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.95) internal successors, (219), 20 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:39,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1723 transitions. [2024-11-09 18:30:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 18:30:39,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:39,983 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:39,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 18:30:40,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:30:40,188 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:40,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:40,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1254478101, now seen corresponding path program 1 times [2024-11-09 18:30:40,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:40,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661118784] [2024-11-09 18:30:40,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:40,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 40 proven. 34 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 18:30:40,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:40,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661118784] [2024-11-09 18:30:40,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661118784] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:30:40,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778490432] [2024-11-09 18:30:40,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:40,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:30:40,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:30:40,419 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:30:40,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 18:30:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:41,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 18:30:41,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:41,339 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 40 proven. 34 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 18:30:41,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:30:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 18:30:41,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778490432] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:30:41,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:30:41,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-09 18:30:41,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511393168] [2024-11-09 18:30:41,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:30:41,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 18:30:41,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:41,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 18:30:41,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 18:30:41,466 INFO L87 Difference]: Start difference. First operand 1248 states and 1723 transitions. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:41,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:41,996 INFO L93 Difference]: Finished difference Result 3478 states and 4693 transitions. [2024-11-09 18:30:41,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 18:30:41,996 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-09 18:30:41,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:42,004 INFO L225 Difference]: With dead ends: 3478 [2024-11-09 18:30:42,005 INFO L226 Difference]: Without dead ends: 3472 [2024-11-09 18:30:42,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 155 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2024-11-09 18:30:42,006 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 244 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:42,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 893 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:30:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2024-11-09 18:30:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 1992. [2024-11-09 18:30:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1992 states, 1991 states have (on average 1.4932194876946259) internal successors, (2973), 1991 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2973 transitions. [2024-11-09 18:30:42,081 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2973 transitions. Word has length 81 [2024-11-09 18:30:42,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:42,081 INFO L471 AbstractCegarLoop]: Abstraction has 1992 states and 2973 transitions. [2024-11-09 18:30:42,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2973 transitions. [2024-11-09 18:30:42,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-09 18:30:42,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:42,083 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:42,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 18:30:42,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-09 18:30:42,288 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:42,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash -122319322, now seen corresponding path program 1 times [2024-11-09 18:30:42,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:42,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622018741] [2024-11-09 18:30:42,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:42,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:42,480 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 18:30:42,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:42,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622018741] [2024-11-09 18:30:42,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622018741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:42,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:42,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 18:30:42,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643722533] [2024-11-09 18:30:42,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:42,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:30:42,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:42,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:30:42,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:30:42,482 INFO L87 Difference]: Start difference. First operand 1992 states and 2973 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:42,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:42,596 INFO L93 Difference]: Finished difference Result 2013 states and 2998 transitions. [2024-11-09 18:30:42,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:30:42,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-09 18:30:42,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:42,602 INFO L225 Difference]: With dead ends: 2013 [2024-11-09 18:30:42,602 INFO L226 Difference]: Without dead ends: 2007 [2024-11-09 18:30:42,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:30:42,603 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 4 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:42,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 168 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:30:42,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2024-11-09 18:30:42,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 2002. [2024-11-09 18:30:42,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2002 states, 2001 states have (on average 1.4917541229385307) internal successors, (2985), 2001 states have internal predecessors, (2985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2985 transitions. [2024-11-09 18:30:42,668 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 2985 transitions. Word has length 82 [2024-11-09 18:30:42,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:42,669 INFO L471 AbstractCegarLoop]: Abstraction has 2002 states and 2985 transitions. [2024-11-09 18:30:42,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:42,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2985 transitions. [2024-11-09 18:30:42,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-09 18:30:42,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:42,671 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:42,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 18:30:42,672 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:42,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:42,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1065673822, now seen corresponding path program 1 times [2024-11-09 18:30:42,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:42,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44743523] [2024-11-09 18:30:42,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:42,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:42,949 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 18:30:42,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:30:42,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44743523] [2024-11-09 18:30:42,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44743523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:30:42,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415558361] [2024-11-09 18:30:42,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:42,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:30:42,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:30:42,953 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:30:42,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 18:30:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:43,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 18:30:43,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 18:30:43,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:30:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 18:30:43,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415558361] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:30:43,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:30:43,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 22 [2024-11-09 18:30:43,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039225644] [2024-11-09 18:30:43,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:30:43,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 18:30:43,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:30:43,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 18:30:43,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-11-09 18:30:43,687 INFO L87 Difference]: Start difference. First operand 2002 states and 2985 transitions. Second operand has 22 states, 22 states have (on average 8.5) internal successors, (187), 22 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:45,491 INFO L93 Difference]: Finished difference Result 5413 states and 7730 transitions. [2024-11-09 18:30:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-09 18:30:45,491 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.5) internal successors, (187), 22 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-09 18:30:45,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:45,511 INFO L225 Difference]: With dead ends: 5413 [2024-11-09 18:30:45,515 INFO L226 Difference]: Without dead ends: 5390 [2024-11-09 18:30:45,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=781, Invalid=3251, Unknown=0, NotChecked=0, Total=4032 [2024-11-09 18:30:45,518 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 283 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:45,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1663 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 18:30:45,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5390 states. [2024-11-09 18:30:45,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5390 to 1986. [2024-11-09 18:30:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1985 states have (on average 1.495214105793451) internal successors, (2968), 1985 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2968 transitions. [2024-11-09 18:30:45,604 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2968 transitions. Word has length 82 [2024-11-09 18:30:45,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:45,605 INFO L471 AbstractCegarLoop]: Abstraction has 1986 states and 2968 transitions. [2024-11-09 18:30:45,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.5) internal successors, (187), 22 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2968 transitions. [2024-11-09 18:30:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 18:30:45,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:45,607 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:45,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 18:30:45,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-09 18:30:45,809 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:45,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:45,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1205067632, now seen corresponding path program 1 times [2024-11-09 18:30:45,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:30:45,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548998562] [2024-11-09 18:30:45,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:45,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:30:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 18:30:45,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 18:30:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 18:30:45,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 18:30:45,910 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 18:30:45,911 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:30:45,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 18:30:45,914 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:45,970 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:30:45,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:30:45 BoogieIcfgContainer [2024-11-09 18:30:45,974 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:30:45,974 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:30:45,975 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:30:45,975 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:30:45,975 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:30:26" (3/4) ... [2024-11-09 18:30:45,977 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-09 18:30:45,977 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:30:45,978 INFO L158 Benchmark]: Toolchain (without parser) took 20054.02ms. Allocated memory was 222.3MB in the beginning and 494.9MB in the end (delta: 272.6MB). Free memory was 147.7MB in the beginning and 224.6MB in the end (delta: -76.9MB). Peak memory consumption was 198.6MB. Max. memory is 16.1GB. [2024-11-09 18:30:45,978 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 111.1MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:30:45,978 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.24ms. Allocated memory is still 222.3MB. Free memory was 147.5MB in the beginning and 132.5MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 18:30:45,978 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.00ms. Allocated memory is still 222.3MB. Free memory was 132.5MB in the beginning and 129.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:30:45,979 INFO L158 Benchmark]: Boogie Preprocessor took 67.70ms. Allocated memory is still 222.3MB. Free memory was 129.5MB in the beginning and 187.6MB in the end (delta: -58.1MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-11-09 18:30:45,979 INFO L158 Benchmark]: IcfgBuilder took 452.34ms. Allocated memory is still 222.3MB. Free memory was 187.6MB in the beginning and 163.6MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 18:30:45,979 INFO L158 Benchmark]: TraceAbstraction took 19198.81ms. Allocated memory was 222.3MB in the beginning and 494.9MB in the end (delta: 272.6MB). Free memory was 163.6MB in the beginning and 224.6MB in the end (delta: -61.0MB). Peak memory consumption was 213.6MB. Max. memory is 16.1GB. [2024-11-09 18:30:45,980 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 494.9MB. Free memory is still 224.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:30:45,981 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 111.1MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.24ms. Allocated memory is still 222.3MB. Free memory was 147.5MB in the beginning and 132.5MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.00ms. Allocated memory is still 222.3MB. Free memory was 132.5MB in the beginning and 129.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.70ms. Allocated memory is still 222.3MB. Free memory was 129.5MB in the beginning and 187.6MB in the end (delta: -58.1MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * IcfgBuilder took 452.34ms. Allocated memory is still 222.3MB. Free memory was 187.6MB in the beginning and 163.6MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19198.81ms. Allocated memory was 222.3MB in the beginning and 494.9MB in the end (delta: 272.6MB). Free memory was 163.6MB in the beginning and 224.6MB in the end (delta: -61.0MB). Peak memory consumption was 213.6MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 494.9MB. Free memory is still 224.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 116. Possible FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4] [L68] nb = (unsigned char)4 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L89] COND TRUE i < nb VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=1, na=4, nb=1, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L85] COND TRUE i == (unsigned char)1 [L85] partial_sum = partial_sum + a1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L89] COND FALSE !(i < nb) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L86] COND TRUE i == (unsigned char)2 [L86] partial_sum = partial_sum + a2 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L89] COND FALSE !(i < nb) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L87] COND TRUE i == (unsigned char)3 [L87] partial_sum = partial_sum + a3 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L89] COND FALSE !(i < nb) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, r0=0, r1=82, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=4, na=4, nb=1, r0=0, r1=82, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, i=4, r0=0, r1=82, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\result=218103808, a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0] [L130] RET, EXPR mp_add(a, b) [L130] r = mp_add(a, b) [L132] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) [L25] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.1s, OverallIterations: 24, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3296 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3296 mSDsluCounter, 9507 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7357 mSDsCounter, 258 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5707 IncrementalHoareTripleChecker+Invalid, 5965 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 258 mSolverCounterUnsat, 2150 mSDtfsCounter, 5707 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1485 GetRequests, 1182 SyntacticMatches, 8 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2894 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2002occurred in iteration=22, InterpolantAutomatonStates: 245, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 10717 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 2176 NumberOfCodeBlocks, 2176 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2456 ConstructedInterpolants, 0 QuantifiedInterpolants, 12966 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2018 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 39 InterpolantComputations, 18 PerfectInterpolantSequences, 1668/2545 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 18:30:46,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:30:48,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:30:48,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 18:30:48,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:30:48,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:30:48,178 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:30:48,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:30:48,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:30:48,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:30:48,180 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:30:48,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:30:48,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:30:48,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:30:48,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:30:48,182 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:30:48,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:30:48,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:30:48,185 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:30:48,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:30:48,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:30:48,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:30:48,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:30:48,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:30:48,186 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 18:30:48,186 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 18:30:48,187 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:30:48,187 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 18:30:48,187 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:30:48,187 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:30:48,187 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:30:48,187 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:30:48,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:30:48,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:30:48,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:30:48,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:30:48,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:30:48,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:30:48,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:30:48,189 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 18:30:48,189 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 18:30:48,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:30:48,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:30:48,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:30:48,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:30:48,190 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2024-11-09 18:30:48,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:30:48,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:30:48,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:30:48,476 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:30:48,477 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:30:48,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2024-11-09 18:30:49,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:30:49,935 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:30:49,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2024-11-09 18:30:49,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ed7613c8/9023aa66365847f481939901721feaeb/FLAG888481a20 [2024-11-09 18:30:49,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ed7613c8/9023aa66365847f481939901721feaeb [2024-11-09 18:30:49,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:30:49,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:30:49,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:30:49,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:30:49,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:30:49,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:30:49" (1/1) ... [2024-11-09 18:30:49,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b1b4ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:49, skipping insertion in model container [2024-11-09 18:30:49,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:30:49" (1/1) ... [2024-11-09 18:30:49,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:30:50,155 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2024-11-09 18:30:50,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:30:50,202 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:30:50,212 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2024-11-09 18:30:50,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:30:50,256 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:30:50,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:50 WrapperNode [2024-11-09 18:30:50,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:30:50,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:30:50,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:30:50,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:30:50,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:50" (1/1) ... [2024-11-09 18:30:50,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:50" (1/1) ... [2024-11-09 18:30:50,285 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 121 [2024-11-09 18:30:50,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:30:50,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:30:50,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:30:50,287 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:30:50,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:50" (1/1) ... [2024-11-09 18:30:50,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:50" (1/1) ... [2024-11-09 18:30:50,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:50" (1/1) ... [2024-11-09 18:30:50,317 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 18:30:50,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:50" (1/1) ... [2024-11-09 18:30:50,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:50" (1/1) ... [2024-11-09 18:30:50,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:50" (1/1) ... [2024-11-09 18:30:50,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:50" (1/1) ... [2024-11-09 18:30:50,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:50" (1/1) ... [2024-11-09 18:30:50,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:50" (1/1) ... [2024-11-09 18:30:50,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:30:50,336 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:30:50,336 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:30:50,336 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:30:50,337 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:50" (1/1) ... [2024-11-09 18:30:50,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:30:50,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:30:50,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 18:30:50,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 18:30:50,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:30:50,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 18:30:50,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:30:50,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:30:50,460 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:30:50,463 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:30:50,728 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-09 18:30:50,728 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:30:50,744 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:30:50,745 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:30:50,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:30:50 BoogieIcfgContainer [2024-11-09 18:30:50,745 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:30:50,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:30:50,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:30:50,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:30:50,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:30:49" (1/3) ... [2024-11-09 18:30:50,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797866ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:30:50, skipping insertion in model container [2024-11-09 18:30:50,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:50" (2/3) ... [2024-11-09 18:30:50,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797866ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:30:50, skipping insertion in model container [2024-11-09 18:30:50,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:30:50" (3/3) ... [2024-11-09 18:30:50,757 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2024-11-09 18:30:50,769 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:30:50,769 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:30:50,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:30:50,830 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4d2bd786, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:30:50,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:30:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 45 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 18:30:50,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:50,843 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:50,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:50,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:50,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1613217370, now seen corresponding path program 1 times [2024-11-09 18:30:50,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:30:50,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803103525] [2024-11-09 18:30:50,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:50,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:50,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:30:50,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:30:50,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 18:30:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:50,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 18:30:50,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:30:50,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:30:50,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:30:50,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803103525] [2024-11-09 18:30:50,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803103525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:50,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:50,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:30:50,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213354875] [2024-11-09 18:30:50,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:50,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 18:30:50,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:30:50,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 18:30:50,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 18:30:50,980 INFO L87 Difference]: Start difference. First operand has 46 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 45 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:50,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:50,992 INFO L93 Difference]: Finished difference Result 63 states and 98 transitions. [2024-11-09 18:30:50,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 18:30:50,993 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 18:30:50,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:50,999 INFO L225 Difference]: With dead ends: 63 [2024-11-09 18:30:50,999 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 18:30:51,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 18:30:51,003 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:51,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:30:51,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 18:30:51,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 18:30:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.675) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 67 transitions. [2024-11-09 18:30:51,026 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 67 transitions. Word has length 13 [2024-11-09 18:30:51,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:51,026 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 67 transitions. [2024-11-09 18:30:51,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:51,027 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 67 transitions. [2024-11-09 18:30:51,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 18:30:51,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:51,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:51,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 18:30:51,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:51,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:51,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:51,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1416797082, now seen corresponding path program 1 times [2024-11-09 18:30:51,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:30:51,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211415175] [2024-11-09 18:30:51,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:51,231 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:51,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:30:51,234 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:30:51,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 18:30:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:51,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 18:30:51,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:30:51,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:30:51,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:30:51,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211415175] [2024-11-09 18:30:51,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211415175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:51,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:51,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:30:51,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530238883] [2024-11-09 18:30:51,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:51,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:30:51,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:30:51,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:30:51,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:30:51,395 INFO L87 Difference]: Start difference. First operand 41 states and 67 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:51,487 INFO L93 Difference]: Finished difference Result 113 states and 194 transitions. [2024-11-09 18:30:51,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:30:51,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 18:30:51,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:51,488 INFO L225 Difference]: With dead ends: 113 [2024-11-09 18:30:51,489 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 18:30:51,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:30:51,490 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 75 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:51,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 142 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:30:51,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 18:30:51,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2024-11-09 18:30:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.6) internal successors, (128), 80 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 128 transitions. [2024-11-09 18:30:51,499 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 128 transitions. Word has length 15 [2024-11-09 18:30:51,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:51,499 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 128 transitions. [2024-11-09 18:30:51,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:51,499 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 128 transitions. [2024-11-09 18:30:51,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 18:30:51,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:51,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:51,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 18:30:51,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:51,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:51,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:51,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2090915027, now seen corresponding path program 1 times [2024-11-09 18:30:51,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:30:51,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361290613] [2024-11-09 18:30:51,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:51,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:51,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:30:51,705 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:30:51,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 18:30:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:51,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 18:30:51,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:30:51,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:30:51,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:30:51,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361290613] [2024-11-09 18:30:51,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361290613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:51,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:51,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:30:51,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449862467] [2024-11-09 18:30:51,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:51,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:30:51,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:30:51,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:30:51,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:30:51,768 INFO L87 Difference]: Start difference. First operand 81 states and 128 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:51,782 INFO L93 Difference]: Finished difference Result 94 states and 145 transitions. [2024-11-09 18:30:51,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:30:51,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 18:30:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:51,782 INFO L225 Difference]: With dead ends: 94 [2024-11-09 18:30:51,783 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 18:30:51,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:30:51,784 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 56 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:51,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:30:51,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 18:30:51,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-09 18:30:51,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 55 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:51,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2024-11-09 18:30:51,793 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 16 [2024-11-09 18:30:51,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:51,793 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2024-11-09 18:30:51,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:51,793 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2024-11-09 18:30:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 18:30:51,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:51,796 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:51,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 18:30:51,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:51,997 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:51,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:51,998 INFO L85 PathProgramCache]: Analyzing trace with hash 299586599, now seen corresponding path program 1 times [2024-11-09 18:30:51,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:30:51,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712400634] [2024-11-09 18:30:51,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:51,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:51,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:30:52,003 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:30:52,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 18:30:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:52,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 18:30:52,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:30:52,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:30:52,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:30:52,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712400634] [2024-11-09 18:30:52,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712400634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:52,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:52,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:30:52,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722086526] [2024-11-09 18:30:52,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:52,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:30:52,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:30:52,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:30:52,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:30:52,149 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:52,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:52,246 INFO L93 Difference]: Finished difference Result 137 states and 202 transitions. [2024-11-09 18:30:52,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:30:52,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 18:30:52,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:52,247 INFO L225 Difference]: With dead ends: 137 [2024-11-09 18:30:52,249 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 18:30:52,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:30:52,250 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 56 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:52,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 120 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:30:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 18:30:52,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-11-09 18:30:52,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4725274725274726) internal successors, (134), 91 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-09 18:30:52,258 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 29 [2024-11-09 18:30:52,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:52,258 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-09 18:30:52,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-09 18:30:52,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 18:30:52,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:52,259 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:52,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 18:30:52,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:52,466 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:52,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:52,467 INFO L85 PathProgramCache]: Analyzing trace with hash -593941867, now seen corresponding path program 1 times [2024-11-09 18:30:52,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:30:52,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488529134] [2024-11-09 18:30:52,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:52,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:52,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:30:52,470 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:30:52,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 18:30:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:52,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 18:30:52,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:52,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:30:52,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:30:52,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:30:52,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488529134] [2024-11-09 18:30:52,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488529134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:52,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:52,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 18:30:52,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328796964] [2024-11-09 18:30:52,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:52,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:30:52,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:30:52,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:30:52,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:30:52,577 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:52,753 INFO L93 Difference]: Finished difference Result 241 states and 372 transitions. [2024-11-09 18:30:52,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 18:30:52,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 18:30:52,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:52,754 INFO L225 Difference]: With dead ends: 241 [2024-11-09 18:30:52,754 INFO L226 Difference]: Without dead ends: 164 [2024-11-09 18:30:52,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:30:52,755 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 94 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:52,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 262 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:30:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-09 18:30:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2024-11-09 18:30:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4387096774193548) internal successors, (223), 155 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 223 transitions. [2024-11-09 18:30:52,764 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 223 transitions. Word has length 30 [2024-11-09 18:30:52,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:52,765 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 223 transitions. [2024-11-09 18:30:52,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:52,765 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 223 transitions. [2024-11-09 18:30:52,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 18:30:52,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:52,766 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:52,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 18:30:52,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:52,969 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:52,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:52,969 INFO L85 PathProgramCache]: Analyzing trace with hash -586859804, now seen corresponding path program 1 times [2024-11-09 18:30:52,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:30:52,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807900346] [2024-11-09 18:30:52,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:52,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:52,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:30:52,972 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:30:52,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 18:30:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:53,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 18:30:53,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:30:53,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:30:53,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:30:53,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807900346] [2024-11-09 18:30:53,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807900346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:53,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:53,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 18:30:53,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703006789] [2024-11-09 18:30:53,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:53,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 18:30:53,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:30:53,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 18:30:53,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:30:53,043 INFO L87 Difference]: Start difference. First operand 156 states and 223 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:53,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:53,375 INFO L93 Difference]: Finished difference Result 353 states and 518 transitions. [2024-11-09 18:30:53,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 18:30:53,375 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 18:30:53,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:53,376 INFO L225 Difference]: With dead ends: 353 [2024-11-09 18:30:53,376 INFO L226 Difference]: Without dead ends: 215 [2024-11-09 18:30:53,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 18:30:53,377 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 227 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:53,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 430 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:30:53,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-09 18:30:53,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 207. [2024-11-09 18:30:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.412621359223301) internal successors, (291), 206 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:53,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 291 transitions. [2024-11-09 18:30:53,397 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 291 transitions. Word has length 31 [2024-11-09 18:30:53,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:53,397 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 291 transitions. [2024-11-09 18:30:53,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:53,397 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 291 transitions. [2024-11-09 18:30:53,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 18:30:53,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:53,398 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:53,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 18:30:53,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:53,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:53,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:53,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2098290699, now seen corresponding path program 1 times [2024-11-09 18:30:53,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:30:53,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844934797] [2024-11-09 18:30:53,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:53,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:53,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:30:53,606 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:30:53,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 18:30:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:53,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 18:30:53,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:30:53,732 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:30:53,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:30:53,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844934797] [2024-11-09 18:30:53,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844934797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:30:53,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:30:53,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 18:30:53,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968307550] [2024-11-09 18:30:53,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:30:53,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:30:53,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:30:53,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:30:53,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:30:53,735 INFO L87 Difference]: Start difference. First operand 207 states and 291 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:53,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:53,826 INFO L93 Difference]: Finished difference Result 467 states and 688 transitions. [2024-11-09 18:30:53,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:30:53,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-09 18:30:53,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:53,827 INFO L225 Difference]: With dead ends: 467 [2024-11-09 18:30:53,827 INFO L226 Difference]: Without dead ends: 281 [2024-11-09 18:30:53,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:30:53,831 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 54 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:53,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 91 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:30:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-09 18:30:53,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 277. [2024-11-09 18:30:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.326086956521739) internal successors, (366), 276 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:53,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 366 transitions. [2024-11-09 18:30:53,847 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 366 transitions. Word has length 33 [2024-11-09 18:30:53,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:53,848 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 366 transitions. [2024-11-09 18:30:53,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 366 transitions. [2024-11-09 18:30:53,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 18:30:53,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:53,853 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:53,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 18:30:54,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:54,054 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:54,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:54,055 INFO L85 PathProgramCache]: Analyzing trace with hash 537249809, now seen corresponding path program 1 times [2024-11-09 18:30:54,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:30:54,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215519426] [2024-11-09 18:30:54,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:54,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:54,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:30:54,060 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:30:54,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 18:30:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:54,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 18:30:54,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:30:54,228 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:30:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:30:54,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:30:54,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215519426] [2024-11-09 18:30:54,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215519426] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:30:54,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:30:54,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-09 18:30:54,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837567666] [2024-11-09 18:30:54,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:30:54,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 18:30:54,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:30:54,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 18:30:54,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-09 18:30:54,350 INFO L87 Difference]: Start difference. First operand 277 states and 366 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:54,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:54,602 INFO L93 Difference]: Finished difference Result 910 states and 1247 transitions. [2024-11-09 18:30:54,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 18:30:54,603 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-09 18:30:54,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:54,605 INFO L225 Difference]: With dead ends: 910 [2024-11-09 18:30:54,605 INFO L226 Difference]: Without dead ends: 660 [2024-11-09 18:30:54,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2024-11-09 18:30:54,606 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 364 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:54,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 421 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:30:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2024-11-09 18:30:54,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 388. [2024-11-09 18:30:54,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 1.3746770025839794) internal successors, (532), 387 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:54,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 532 transitions. [2024-11-09 18:30:54,658 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 532 transitions. Word has length 49 [2024-11-09 18:30:54,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:54,658 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 532 transitions. [2024-11-09 18:30:54,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 532 transitions. [2024-11-09 18:30:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 18:30:54,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:54,661 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:54,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 18:30:54,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:54,861 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:54,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:54,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2044801618, now seen corresponding path program 1 times [2024-11-09 18:30:54,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:30:54,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661367008] [2024-11-09 18:30:54,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:54,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:54,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:30:54,867 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:30:54,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 18:30:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:54,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 18:30:54,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:30:55,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:30:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:30:55,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:30:55,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661367008] [2024-11-09 18:30:55,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661367008] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:30:55,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:30:55,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-09 18:30:55,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324695915] [2024-11-09 18:30:55,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:30:55,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 18:30:55,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:30:55,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 18:30:55,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-09 18:30:55,105 INFO L87 Difference]: Start difference. First operand 388 states and 532 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:55,358 INFO L93 Difference]: Finished difference Result 1131 states and 1630 transitions. [2024-11-09 18:30:55,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 18:30:55,359 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-09 18:30:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:55,361 INFO L225 Difference]: With dead ends: 1131 [2024-11-09 18:30:55,361 INFO L226 Difference]: Without dead ends: 744 [2024-11-09 18:30:55,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2024-11-09 18:30:55,362 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 142 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:55,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 168 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:30:55,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2024-11-09 18:30:55,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 613. [2024-11-09 18:30:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 612 states have (on average 1.3333333333333333) internal successors, (816), 612 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:55,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 816 transitions. [2024-11-09 18:30:55,381 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 816 transitions. Word has length 49 [2024-11-09 18:30:55,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:55,382 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 816 transitions. [2024-11-09 18:30:55,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:55,382 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 816 transitions. [2024-11-09 18:30:55,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 18:30:55,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:55,383 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:55,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 18:30:55,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:55,584 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:55,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:55,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1561520471, now seen corresponding path program 1 times [2024-11-09 18:30:55,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:30:55,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065796109] [2024-11-09 18:30:55,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:30:55,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:55,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:30:55,587 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:30:55,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 18:30:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:30:55,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 18:30:55,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 73 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:30:55,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:30:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 76 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:30:55,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:30:55,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065796109] [2024-11-09 18:30:55,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065796109] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:30:55,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:30:55,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2024-11-09 18:30:55,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037337057] [2024-11-09 18:30:55,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:30:55,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 18:30:55,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:30:55,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 18:30:55,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 18:30:55,784 INFO L87 Difference]: Start difference. First operand 613 states and 816 transitions. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:55,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:30:55,973 INFO L93 Difference]: Finished difference Result 1541 states and 1978 transitions. [2024-11-09 18:30:55,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 18:30:55,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-09 18:30:55,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:30:55,976 INFO L225 Difference]: With dead ends: 1541 [2024-11-09 18:30:55,976 INFO L226 Difference]: Without dead ends: 955 [2024-11-09 18:30:55,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2024-11-09 18:30:55,977 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 253 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:30:55,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 359 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:30:55,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-11-09 18:30:56,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 600. [2024-11-09 18:30:56,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.2821368948247078) internal successors, (768), 599 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:56,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 768 transitions. [2024-11-09 18:30:56,009 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 768 transitions. Word has length 77 [2024-11-09 18:30:56,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:30:56,009 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 768 transitions. [2024-11-09 18:30:56,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:30:56,009 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 768 transitions. [2024-11-09 18:30:56,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 18:30:56,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:30:56,010 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:30:56,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-09 18:30:56,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:56,213 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:30:56,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:30:56,213 INFO L85 PathProgramCache]: Analyzing trace with hash -868418774, now seen corresponding path program 2 times [2024-11-09 18:30:56,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:30:56,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147958270] [2024-11-09 18:30:56,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 18:30:56,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:30:56,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:30:56,216 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:30:56,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 18:30:56,261 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 18:30:56,261 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:30:56,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 18:30:56,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:30:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:30:58,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:31:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:31:00,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:31:00,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147958270] [2024-11-09 18:31:00,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147958270] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:31:00,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:31:00,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2024-11-09 18:31:00,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849378874] [2024-11-09 18:31:00,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:31:00,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-09 18:31:00,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:31:00,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 18:31:00,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1750, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 18:31:00,542 INFO L87 Difference]: Start difference. First operand 600 states and 768 transitions. Second operand has 44 states, 44 states have (on average 3.4318181818181817) internal successors, (151), 44 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:31:10,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:31:10,536 INFO L93 Difference]: Finished difference Result 1679 states and 2116 transitions. [2024-11-09 18:31:10,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-11-09 18:31:10,536 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.4318181818181817) internal successors, (151), 44 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-09 18:31:10,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:31:10,540 INFO L225 Difference]: With dead ends: 1679 [2024-11-09 18:31:10,540 INFO L226 Difference]: Without dead ends: 1565 [2024-11-09 18:31:10,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3286 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2403, Invalid=13347, Unknown=0, NotChecked=0, Total=15750 [2024-11-09 18:31:10,548 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 2471 mSDsluCounter, 6629 mSDsCounter, 0 mSdLazyCounter, 3358 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2471 SdHoareTripleChecker+Valid, 6973 SdHoareTripleChecker+Invalid, 3558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 3358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 18:31:10,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2471 Valid, 6973 Invalid, 3558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 3358 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 18:31:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2024-11-09 18:31:10,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 945. [2024-11-09 18:31:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 944 states have (on average 1.3019067796610169) internal successors, (1229), 944 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:31:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1229 transitions. [2024-11-09 18:31:10,637 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1229 transitions. Word has length 77 [2024-11-09 18:31:10,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:31:10,637 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1229 transitions. [2024-11-09 18:31:10,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.4318181818181817) internal successors, (151), 44 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:31:10,637 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1229 transitions. [2024-11-09 18:31:10,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 18:31:10,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:31:10,638 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:31:10,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 18:31:10,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:31:10,839 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:31:10,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:31:10,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1352094101, now seen corresponding path program 1 times [2024-11-09 18:31:10,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:31:10,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441907287] [2024-11-09 18:31:10,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:31:10,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:31:10,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:31:10,843 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:31:10,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 18:31:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:31:10,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 18:31:10,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:31:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 18:31:10,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:31:11,039 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 54 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 18:31:11,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:31:11,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441907287] [2024-11-09 18:31:11,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1441907287] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:31:11,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:31:11,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-09 18:31:11,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789660180] [2024-11-09 18:31:11,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:31:11,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 18:31:11,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:31:11,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 18:31:11,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-09 18:31:11,041 INFO L87 Difference]: Start difference. First operand 945 states and 1229 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:31:11,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:31:11,546 INFO L93 Difference]: Finished difference Result 2285 states and 3001 transitions. [2024-11-09 18:31:11,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 18:31:11,546 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-09 18:31:11,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:31:11,549 INFO L225 Difference]: With dead ends: 2285 [2024-11-09 18:31:11,549 INFO L226 Difference]: Without dead ends: 1081 [2024-11-09 18:31:11,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2024-11-09 18:31:11,551 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 601 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:31:11,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 330 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:31:11,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2024-11-09 18:31:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 883. [2024-11-09 18:31:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 1.2709750566893423) internal successors, (1121), 882 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:31:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1121 transitions. [2024-11-09 18:31:11,592 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1121 transitions. Word has length 77 [2024-11-09 18:31:11,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:31:11,593 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1121 transitions. [2024-11-09 18:31:11,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:31:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1121 transitions. [2024-11-09 18:31:11,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 18:31:11,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:31:11,596 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:31:11,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-09 18:31:11,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:31:11,796 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:31:11,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:31:11,797 INFO L85 PathProgramCache]: Analyzing trace with hash 801314736, now seen corresponding path program 1 times [2024-11-09 18:31:11,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:31:11,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011406229] [2024-11-09 18:31:11,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:31:11,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:31:11,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:31:11,799 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:31:11,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 18:31:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:31:11,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 18:31:11,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:31:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:31:14,259 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:31:16,427 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:31:16,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:31:16,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011406229] [2024-11-09 18:31:16,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011406229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:31:16,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:31:16,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2024-11-09 18:31:16,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137167986] [2024-11-09 18:31:16,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:31:16,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 18:31:16,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:31:16,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 18:31:16,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2024-11-09 18:31:16,429 INFO L87 Difference]: Start difference. First operand 883 states and 1121 transitions. Second operand has 46 states, 46 states have (on average 3.4565217391304346) internal successors, (159), 46 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:31:39,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:31:39,647 INFO L93 Difference]: Finished difference Result 2340 states and 2911 transitions. [2024-11-09 18:31:39,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2024-11-09 18:31:39,647 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.4565217391304346) internal successors, (159), 46 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-09 18:31:39,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:31:39,652 INFO L225 Difference]: With dead ends: 2340 [2024-11-09 18:31:39,652 INFO L226 Difference]: Without dead ends: 2220 [2024-11-09 18:31:39,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9718 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=4389, Invalid=31143, Unknown=0, NotChecked=0, Total=35532 [2024-11-09 18:31:39,658 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 1586 mSDsluCounter, 11816 mSDsCounter, 0 mSdLazyCounter, 6228 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 12275 SdHoareTripleChecker+Invalid, 6404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 6228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-09 18:31:39,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1586 Valid, 12275 Invalid, 6404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 6228 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-09 18:31:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2024-11-09 18:31:39,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 1399. [2024-11-09 18:31:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1398 states have (on average 1.253934191702432) internal successors, (1753), 1398 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:31:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1753 transitions. [2024-11-09 18:31:39,757 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1753 transitions. Word has length 81 [2024-11-09 18:31:39,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:31:39,757 INFO L471 AbstractCegarLoop]: Abstraction has 1399 states and 1753 transitions. [2024-11-09 18:31:39,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.4565217391304346) internal successors, (159), 46 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:31:39,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1753 transitions. [2024-11-09 18:31:39,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 18:31:39,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:31:39,759 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:31:39,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-09 18:31:39,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:31:39,964 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:31:39,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:31:39,965 INFO L85 PathProgramCache]: Analyzing trace with hash -814078222, now seen corresponding path program 1 times [2024-11-09 18:31:39,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:31:39,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916839828] [2024-11-09 18:31:39,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:31:39,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:31:39,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:31:39,968 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:31:39,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 18:31:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:31:40,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 18:31:40,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:31:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:31:42,493 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:31:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:31:44,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:31:44,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916839828] [2024-11-09 18:31:44,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916839828] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:31:44,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:31:44,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2024-11-09 18:31:44,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295235500] [2024-11-09 18:31:44,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:31:44,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 18:31:44,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:31:44,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 18:31:44,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1933, Unknown=0, NotChecked=0, Total=2070 [2024-11-09 18:31:44,459 INFO L87 Difference]: Start difference. First operand 1399 states and 1753 transitions. Second operand has 46 states, 46 states have (on average 3.4565217391304346) internal successors, (159), 46 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)