./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.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 2ed23d94a5510a02522217ac25d44c0be6f4c30553346d9a869cec0689948ba9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:13:04,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:13:04,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:13:04,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:13:04,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:13:04,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:13:04,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:13:04,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:13:04,383 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:13:04,383 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:13:04,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:13:04,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:13:04,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:13:04,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:13:04,385 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:13:04,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:13:04,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:13:04,386 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:13:04,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:13:04,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:13:04,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:13:04,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:13:04,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:13:04,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:13:04,391 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:13:04,391 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:13:04,392 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:13:04,392 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:13:04,392 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:13:04,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:13:04,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:13:04,393 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:13:04,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:13:04,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:13:04,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:13:04,393 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:13:04,394 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:13:04,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:13:04,394 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:13:04,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:13:04,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:13:04,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:13:04,395 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 -> 2ed23d94a5510a02522217ac25d44c0be6f4c30553346d9a869cec0689948ba9 [2024-11-08 22:13:04,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:13:04,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:13:04,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:13:04,695 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:13:04,696 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:13:04,698 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-11-08 22:13:06,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:13:06,287 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:13:06,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-11-08 22:13:06,304 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f427a0974/14157ade9fb94960a88f792f81fc1ff8/FLAG4904d3fdb [2024-11-08 22:13:06,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f427a0974/14157ade9fb94960a88f792f81fc1ff8 [2024-11-08 22:13:06,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:13:06,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:13:06,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:13:06,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:13:06,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:13:06,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:13:06" (1/1) ... [2024-11-08 22:13:06,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2d8f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:06, skipping insertion in model container [2024-11-08 22:13:06,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:13:06" (1/1) ... [2024-11-08 22:13:06,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:13:06,922 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i[919,932] [2024-11-08 22:13:06,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:13:07,009 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:13:07,024 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i[919,932] [2024-11-08 22:13:07,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:13:07,082 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:13:07,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:07 WrapperNode [2024-11-08 22:13:07,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:13:07,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:13:07,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:13:07,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:13:07,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:07" (1/1) ... [2024-11-08 22:13:07,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:07" (1/1) ... [2024-11-08 22:13:07,146 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 287 [2024-11-08 22:13:07,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:13:07,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:13:07,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:13:07,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:13:07,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:07" (1/1) ... [2024-11-08 22:13:07,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:07" (1/1) ... [2024-11-08 22:13:07,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:07" (1/1) ... [2024-11-08 22:13:07,188 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-08 22:13:07,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:07" (1/1) ... [2024-11-08 22:13:07,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:07" (1/1) ... [2024-11-08 22:13:07,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:07" (1/1) ... [2024-11-08 22:13:07,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:07" (1/1) ... [2024-11-08 22:13:07,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:07" (1/1) ... [2024-11-08 22:13:07,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:07" (1/1) ... [2024-11-08 22:13:07,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:13:07,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:13:07,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:13:07,219 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:13:07,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:07" (1/1) ... [2024-11-08 22:13:07,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:13:07,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:13:07,257 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-08 22:13:07,262 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-08 22:13:07,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:13:07,314 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:13:07,316 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:13:07,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:13:07,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:13:07,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:13:07,424 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:13:07,427 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:13:07,875 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 22:13:07,876 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:13:07,894 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:13:07,895 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:13:07,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:13:07 BoogieIcfgContainer [2024-11-08 22:13:07,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:13:07,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:13:07,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:13:07,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:13:07,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:13:06" (1/3) ... [2024-11-08 22:13:07,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791e49f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:13:07, skipping insertion in model container [2024-11-08 22:13:07,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:07" (2/3) ... [2024-11-08 22:13:07,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791e49f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:13:07, skipping insertion in model container [2024-11-08 22:13:07,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:13:07" (3/3) ... [2024-11-08 22:13:07,907 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-11-08 22:13:07,924 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:13:07,925 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:13:07,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:13:08,003 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;@25095591, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:13:08,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:13:08,009 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 22:13:08,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 22:13:08,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:13:08,032 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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, 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, 1, 1, 1] [2024-11-08 22:13:08,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:13:08,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:13:08,040 INFO L85 PathProgramCache]: Analyzing trace with hash 237656672, now seen corresponding path program 1 times [2024-11-08 22:13:08,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:13:08,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954607420] [2024-11-08 22:13:08,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:08,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:13:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:08,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:13:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:08,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:13:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:08,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:13:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:08,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:13:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:08,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:13:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:08,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:13:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:08,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:13:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:08,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:13:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:08,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:13:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:08,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:13:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:08,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:13:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:08,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:13:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:08,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:13:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:08,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:13:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:13:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:13:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:13:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:13:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:13:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:13:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:13:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:13:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:13:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:13:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:13:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:13:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 22:13:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:13:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 22:13:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:13:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 22:13:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:13:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:13:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 22:13:09,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:13:09,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954607420] [2024-11-08 22:13:09,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954607420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:13:09,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:13:09,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:13:09,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095354586] [2024-11-08 22:13:09,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:13:09,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:13:09,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:13:09,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:13:09,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:13:09,204 INFO L87 Difference]: Start difference. First operand has 122 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 22:13:09,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:13:09,590 INFO L93 Difference]: Finished difference Result 380 states and 683 transitions. [2024-11-08 22:13:09,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:13:09,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2024-11-08 22:13:09,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:13:09,609 INFO L225 Difference]: With dead ends: 380 [2024-11-08 22:13:09,609 INFO L226 Difference]: Without dead ends: 261 [2024-11-08 22:13:09,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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-08 22:13:09,621 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 243 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 22:13:09,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 483 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 22:13:09,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-08 22:13:09,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 229. [2024-11-08 22:13:09,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 160 states have (on average 1.45625) internal successors, (233), 160 states have internal predecessors, (233), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 22:13:09,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 365 transitions. [2024-11-08 22:13:09,706 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 365 transitions. Word has length 213 [2024-11-08 22:13:09,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:13:09,707 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 365 transitions. [2024-11-08 22:13:09,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 22:13:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 365 transitions. [2024-11-08 22:13:09,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-08 22:13:09,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:13:09,712 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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, 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, 1, 1, 1, 1] [2024-11-08 22:13:09,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:13:09,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:13:09,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:13:09,714 INFO L85 PathProgramCache]: Analyzing trace with hash -377513104, now seen corresponding path program 1 times [2024-11-08 22:13:09,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:13:09,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160215762] [2024-11-08 22:13:09,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:09,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:13:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:13:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:13:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:13:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:13:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:13:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:13:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:13:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:13:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:13:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:13:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:13:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:13:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:13:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:13:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:13:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:13:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:13:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:13:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:13:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:13:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:13:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:13:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:13:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:13:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:13:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:13:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 22:13:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:13:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 22:13:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:13:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 22:13:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:13:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:13:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 22:13:10,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:13:10,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160215762] [2024-11-08 22:13:10,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160215762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:13:10,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:13:10,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:13:10,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968552562] [2024-11-08 22:13:10,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:13:10,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:13:10,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:13:10,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:13:10,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:13:10,013 INFO L87 Difference]: Start difference. First operand 229 states and 365 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 22:13:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:13:10,167 INFO L93 Difference]: Finished difference Result 679 states and 1085 transitions. [2024-11-08 22:13:10,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:13:10,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2024-11-08 22:13:10,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:13:10,177 INFO L225 Difference]: With dead ends: 679 [2024-11-08 22:13:10,179 INFO L226 Difference]: Without dead ends: 453 [2024-11-08 22:13:10,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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-08 22:13:10,185 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 163 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:13:10,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 408 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:13:10,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-08 22:13:10,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 451. [2024-11-08 22:13:10,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 314 states have (on average 1.4522292993630572) internal successors, (456), 314 states have internal predecessors, (456), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-08 22:13:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 720 transitions. [2024-11-08 22:13:10,249 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 720 transitions. Word has length 214 [2024-11-08 22:13:10,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:13:10,250 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 720 transitions. [2024-11-08 22:13:10,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 22:13:10,250 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 720 transitions. [2024-11-08 22:13:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-08 22:13:10,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:13:10,254 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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, 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, 1, 1, 1, 1] [2024-11-08 22:13:10,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:13:10,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:13:10,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:13:10,255 INFO L85 PathProgramCache]: Analyzing trace with hash 80534128, now seen corresponding path program 1 times [2024-11-08 22:13:10,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:13:10,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930632790] [2024-11-08 22:13:10,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:10,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:13:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:13:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:13:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:13:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:13:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:13:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:13:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:13:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:13:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:13:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:13:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:13:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:13:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:13:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:13:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:13:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:13:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:13:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:13:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:13:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:13:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:13:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:13:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:13:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:13:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:13:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:13:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 22:13:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:13:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 22:13:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:13:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 22:13:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:13:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:13:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 22:13:10,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:13:10,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930632790] [2024-11-08 22:13:10,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930632790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:13:10,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:13:10,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 22:13:10,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092496488] [2024-11-08 22:13:10,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:13:10,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:13:10,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:13:10,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:13:10,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:13:10,601 INFO L87 Difference]: Start difference. First operand 451 states and 720 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 22:13:11,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:13:11,260 INFO L93 Difference]: Finished difference Result 1700 states and 2691 transitions. [2024-11-08 22:13:11,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:13:11,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2024-11-08 22:13:11,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:13:11,271 INFO L225 Difference]: With dead ends: 1700 [2024-11-08 22:13:11,271 INFO L226 Difference]: Without dead ends: 1252 [2024-11-08 22:13:11,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:13:11,274 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 425 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 22:13:11,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 592 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 22:13:11,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2024-11-08 22:13:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1238. [2024-11-08 22:13:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 937 states have (on average 1.48025613660619) internal successors, (1387), 945 states have internal predecessors, (1387), 286 states have call successors, (286), 14 states have call predecessors, (286), 14 states have return successors, (286), 278 states have call predecessors, (286), 286 states have call successors, (286) [2024-11-08 22:13:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1959 transitions. [2024-11-08 22:13:11,421 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1959 transitions. Word has length 214 [2024-11-08 22:13:11,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:13:11,422 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1959 transitions. [2024-11-08 22:13:11,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 22:13:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1959 transitions. [2024-11-08 22:13:11,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-08 22:13:11,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:13:11,428 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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, 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, 1, 1, 1, 1] [2024-11-08 22:13:11,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:13:11,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:13:11,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:13:11,429 INFO L85 PathProgramCache]: Analyzing trace with hash 633604146, now seen corresponding path program 1 times [2024-11-08 22:13:11,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:13:11,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974677840] [2024-11-08 22:13:11,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:11,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:13:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:13:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:13:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:13:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:13:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:13:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:13:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:13:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:13:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:13:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:13:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:13:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:13:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:13:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:13:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:13:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:13:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:13:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:13:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:13:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:13:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:13:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:13:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:13:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:13:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:13:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:13:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 22:13:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:13:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 22:13:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:13:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 22:13:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:13:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:11,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:13:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:12,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 22:13:12,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:13:12,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974677840] [2024-11-08 22:13:12,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974677840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:13:12,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:13:12,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 22:13:12,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661310665] [2024-11-08 22:13:12,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:13:12,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:13:12,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:13:12,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:13:12,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:13:12,006 INFO L87 Difference]: Start difference. First operand 1238 states and 1959 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 22:13:12,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:13:12,684 INFO L93 Difference]: Finished difference Result 1800 states and 2833 transitions. [2024-11-08 22:13:12,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:13:12,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2024-11-08 22:13:12,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:13:12,700 INFO L225 Difference]: With dead ends: 1800 [2024-11-08 22:13:12,701 INFO L226 Difference]: Without dead ends: 1575 [2024-11-08 22:13:12,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:13:12,706 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 325 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 22:13:12,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 726 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 22:13:12,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-11-08 22:13:12,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1556. [2024-11-08 22:13:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1204 states have (on average 1.4883720930232558) internal successors, (1792), 1217 states have internal predecessors, (1792), 332 states have call successors, (332), 19 states have call predecessors, (332), 19 states have return successors, (332), 319 states have call predecessors, (332), 332 states have call successors, (332) [2024-11-08 22:13:12,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2456 transitions. [2024-11-08 22:13:12,905 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2456 transitions. Word has length 214 [2024-11-08 22:13:12,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:13:12,906 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2456 transitions. [2024-11-08 22:13:12,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 22:13:12,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2456 transitions. [2024-11-08 22:13:12,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-08 22:13:12,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:13:12,910 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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, 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, 1, 1, 1, 1] [2024-11-08 22:13:12,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 22:13:12,910 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:13:12,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:13:12,911 INFO L85 PathProgramCache]: Analyzing trace with hash 142573742, now seen corresponding path program 1 times [2024-11-08 22:13:12,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:13:12,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475589090] [2024-11-08 22:13:12,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:12,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:13:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:13:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:13:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:13:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:13:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:13:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:13:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:13:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:13:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:13:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:13:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:13:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:13:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:13:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:13:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:13:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:13:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:13:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:13:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:13:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:13:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:13:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:13:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:13:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:13:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:13:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:13:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 22:13:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:13:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 22:13:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:13:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 22:13:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:13:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:13:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 22:13:13,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:13:13,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475589090] [2024-11-08 22:13:13,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475589090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:13:13,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:13:13,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:13:13,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896228892] [2024-11-08 22:13:13,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:13:13,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:13:13,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:13:13,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:13:13,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:13:13,265 INFO L87 Difference]: Start difference. First operand 1556 states and 2456 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 22:13:13,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:13:13,420 INFO L93 Difference]: Finished difference Result 2603 states and 4109 transitions. [2024-11-08 22:13:13,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:13:13,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2024-11-08 22:13:13,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:13:13,430 INFO L225 Difference]: With dead ends: 2603 [2024-11-08 22:13:13,431 INFO L226 Difference]: Without dead ends: 1050 [2024-11-08 22:13:13,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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-08 22:13:13,436 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 119 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:13:13,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 315 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:13:13,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2024-11-08 22:13:13,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1048. [2024-11-08 22:13:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 812 states have (on average 1.4642857142857142) internal successors, (1189), 821 states have internal predecessors, (1189), 222 states have call successors, (222), 13 states have call predecessors, (222), 13 states have return successors, (222), 213 states have call predecessors, (222), 222 states have call successors, (222) [2024-11-08 22:13:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1633 transitions. [2024-11-08 22:13:13,527 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1633 transitions. Word has length 214 [2024-11-08 22:13:13,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:13:13,528 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1633 transitions. [2024-11-08 22:13:13,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 22:13:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1633 transitions. [2024-11-08 22:13:13,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 22:13:13,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:13:13,531 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2024-11-08 22:13:13,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 22:13:13,531 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:13:13,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:13:13,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1562897297, now seen corresponding path program 1 times [2024-11-08 22:13:13,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:13:13,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208629567] [2024-11-08 22:13:13,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:13,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:13:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:13:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:13:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:13:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:13:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:13:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:13:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:13:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:13:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:13:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:13:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:13:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:13:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:13:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:13:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:13:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:13:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:13:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:13:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:13:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:13:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:13:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:13:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:13:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:13:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:13:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:13:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 22:13:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:13:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 22:13:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:13:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 22:13:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:13:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:13:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 22:13:13,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:13:13,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208629567] [2024-11-08 22:13:13,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208629567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:13:13,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:13:13,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:13:13,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157726337] [2024-11-08 22:13:13,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:13:13,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:13:13,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:13:13,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:13:13,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:13:13,878 INFO L87 Difference]: Start difference. First operand 1048 states and 1633 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 22:13:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:13:14,077 INFO L93 Difference]: Finished difference Result 1803 states and 2821 transitions. [2024-11-08 22:13:14,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:13:14,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 216 [2024-11-08 22:13:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:13:14,084 INFO L225 Difference]: With dead ends: 1803 [2024-11-08 22:13:14,084 INFO L226 Difference]: Without dead ends: 758 [2024-11-08 22:13:14,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 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-08 22:13:14,089 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 143 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:13:14,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 527 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:13:14,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-11-08 22:13:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 672. [2024-11-08 22:13:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 518 states have (on average 1.472972972972973) internal successors, (763), 523 states have internal predecessors, (763), 145 states have call successors, (145), 8 states have call predecessors, (145), 8 states have return successors, (145), 140 states have call predecessors, (145), 145 states have call successors, (145) [2024-11-08 22:13:14,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1053 transitions. [2024-11-08 22:13:14,141 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1053 transitions. Word has length 216 [2024-11-08 22:13:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:13:14,142 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 1053 transitions. [2024-11-08 22:13:14,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 22:13:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1053 transitions. [2024-11-08 22:13:14,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 22:13:14,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:13:14,146 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2024-11-08 22:13:14,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 22:13:14,146 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:13:14,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:13:14,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1720952749, now seen corresponding path program 1 times [2024-11-08 22:13:14,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:13:14,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745254033] [2024-11-08 22:13:14,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:14,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:13:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:14,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:13:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:14,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:13:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:14,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:13:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:14,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:13:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:14,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:13:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:14,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:13:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:14,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:13:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:14,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:13:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:14,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:13:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:14,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:13:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:14,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:13:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:14,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:13:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:14,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:13:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:13:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:13:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:13:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:13:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:13:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:13:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:13:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:13:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:13:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:13:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:13:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:13:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:13:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 22:13:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:13:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 22:13:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:13:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 22:13:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:13:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:13:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 22:13:15,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:13:15,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745254033] [2024-11-08 22:13:15,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745254033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:13:15,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:13:15,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 22:13:15,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492504431] [2024-11-08 22:13:15,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:13:15,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 22:13:15,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:13:15,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 22:13:15,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 22:13:15,178 INFO L87 Difference]: Start difference. First operand 672 states and 1053 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 22:13:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:13:16,183 INFO L93 Difference]: Finished difference Result 1409 states and 2200 transitions. [2024-11-08 22:13:16,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 22:13:16,184 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 216 [2024-11-08 22:13:16,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:13:16,191 INFO L225 Difference]: With dead ends: 1409 [2024-11-08 22:13:16,192 INFO L226 Difference]: Without dead ends: 848 [2024-11-08 22:13:16,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-08 22:13:16,196 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 406 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 22:13:16,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 605 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 22:13:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-11-08 22:13:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 824. [2024-11-08 22:13:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 646 states have (on average 1.4659442724458205) internal successors, (947), 653 states have internal predecessors, (947), 165 states have call successors, (165), 12 states have call predecessors, (165), 12 states have return successors, (165), 158 states have call predecessors, (165), 165 states have call successors, (165) [2024-11-08 22:13:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1277 transitions. [2024-11-08 22:13:16,252 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1277 transitions. Word has length 216 [2024-11-08 22:13:16,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:13:16,253 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1277 transitions. [2024-11-08 22:13:16,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 22:13:16,253 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1277 transitions. [2024-11-08 22:13:16,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-08 22:13:16,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:13:16,257 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:13:16,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 22:13:16,257 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:13:16,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:13:16,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1475066503, now seen corresponding path program 1 times [2024-11-08 22:13:16,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:13:16,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83994828] [2024-11-08 22:13:16,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:16,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:13:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:13:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:13:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:13:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:13:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:13:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:13:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:13:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:13:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:13:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:13:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:13:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:13:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:13:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:13:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:13:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:13:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:13:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:13:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:13:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:13:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:13:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:13:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:13:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:13:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:13:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:13:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 22:13:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:13:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 22:13:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:13:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 22:13:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:13:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:13:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 22:13:16,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:13:16,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83994828] [2024-11-08 22:13:16,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83994828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:13:16,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:13:16,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:13:16,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461313069] [2024-11-08 22:13:16,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:13:16,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:13:16,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:13:16,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:13:16,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:13:16,413 INFO L87 Difference]: Start difference. First operand 824 states and 1277 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 22:13:16,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:13:16,515 INFO L93 Difference]: Finished difference Result 2084 states and 3232 transitions. [2024-11-08 22:13:16,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:13:16,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 217 [2024-11-08 22:13:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:13:16,525 INFO L225 Difference]: With dead ends: 2084 [2024-11-08 22:13:16,526 INFO L226 Difference]: Without dead ends: 1447 [2024-11-08 22:13:16,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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-08 22:13:16,529 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 174 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:13:16,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 346 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:13:16,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2024-11-08 22:13:16,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 923. [2024-11-08 22:13:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 745 states have (on average 1.4845637583892617) internal successors, (1106), 752 states have internal predecessors, (1106), 165 states have call successors, (165), 12 states have call predecessors, (165), 12 states have return successors, (165), 158 states have call predecessors, (165), 165 states have call successors, (165) [2024-11-08 22:13:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1436 transitions. [2024-11-08 22:13:16,610 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1436 transitions. Word has length 217 [2024-11-08 22:13:16,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:13:16,612 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1436 transitions. [2024-11-08 22:13:16,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 22:13:16,612 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1436 transitions. [2024-11-08 22:13:16,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-08 22:13:16,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:13:16,615 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:13:16,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 22:13:16,615 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:13:16,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:13:16,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1868093513, now seen corresponding path program 1 times [2024-11-08 22:13:16,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:13:16,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011919297] [2024-11-08 22:13:16,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:16,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:13:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:13:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:13:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:13:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:13:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:13:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:13:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:13:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:13:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:13:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:13:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:13:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:13:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:13:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:13:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:13:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:13:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:13:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:13:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:13:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:13:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:13:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:13:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:13:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:13:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:13:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:13:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 22:13:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:13:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 22:13:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:13:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 22:13:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:13:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:13:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 72 proven. 24 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 22:13:16,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:13:16,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011919297] [2024-11-08 22:13:16,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011919297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:13:16,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599291807] [2024-11-08 22:13:16,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:16,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:13:16,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:13:16,943 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-08 22:13:16,945 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-08 22:13:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:17,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 22:13:17,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:13:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 848 proven. 24 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2024-11-08 22:13:17,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:13:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 72 proven. 24 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 22:13:17,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599291807] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:13:17,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 22:13:17,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 22:13:17,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943670929] [2024-11-08 22:13:17,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 22:13:17,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 22:13:17,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:13:17,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 22:13:17,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:13:17,566 INFO L87 Difference]: Start difference. First operand 923 states and 1436 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-08 22:13:17,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:13:17,845 INFO L93 Difference]: Finished difference Result 1724 states and 2666 transitions. [2024-11-08 22:13:17,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 22:13:17,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 217 [2024-11-08 22:13:17,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:13:17,852 INFO L225 Difference]: With dead ends: 1724 [2024-11-08 22:13:17,853 INFO L226 Difference]: Without dead ends: 941 [2024-11-08 22:13:17,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 496 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-08 22:13:17,857 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 124 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:13:17,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 368 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:13:17,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-11-08 22:13:17,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 935. [2024-11-08 22:13:17,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 754 states have (on average 1.4496021220159152) internal successors, (1093), 761 states have internal predecessors, (1093), 165 states have call successors, (165), 15 states have call predecessors, (165), 15 states have return successors, (165), 158 states have call predecessors, (165), 165 states have call successors, (165) [2024-11-08 22:13:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1423 transitions. [2024-11-08 22:13:17,932 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1423 transitions. Word has length 217 [2024-11-08 22:13:17,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:13:17,933 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1423 transitions. [2024-11-08 22:13:17,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-08 22:13:17,933 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1423 transitions. [2024-11-08 22:13:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-08 22:13:17,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:13:17,936 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:13:17,956 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-08 22:13:18,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:13:18,138 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:13:18,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:13:18,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1050445063, now seen corresponding path program 1 times [2024-11-08 22:13:18,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:13:18,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294601716] [2024-11-08 22:13:18,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:18,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:13:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:13:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:13:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:13:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:13:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:13:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:13:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:13:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:13:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:13:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:13:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:13:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:13:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:13:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:13:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:13:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:13:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:13:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:13:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:13:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:13:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:13:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:13:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:13:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:13:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:13:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:13:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 22:13:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:13:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:19,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 22:13:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:20,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:13:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:20,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 22:13:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:20,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:13:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:20,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:13:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 22:13:20,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:13:20,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294601716] [2024-11-08 22:13:20,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294601716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:13:20,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437990079] [2024-11-08 22:13:20,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:20,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:13:20,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:13:20,106 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-08 22:13:20,108 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-08 22:13:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:20,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 22:13:20,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:13:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1058 proven. 39 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2024-11-08 22:13:20,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:13:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 57 proven. 39 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 22:13:20,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437990079] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:13:20,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 22:13:20,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2024-11-08 22:13:20,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128535643] [2024-11-08 22:13:20,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 22:13:20,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 22:13:20,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:13:20,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 22:13:20,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-08 22:13:20,813 INFO L87 Difference]: Start difference. First operand 935 states and 1423 transitions. Second operand has 16 states, 15 states have (on average 7.0) internal successors, (105), 16 states have internal predecessors, (105), 6 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 5 states have call predecessors, (80), 6 states have call successors, (80) [2024-11-08 22:13:23,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:13:23,085 INFO L93 Difference]: Finished difference Result 1626 states and 2451 transitions. [2024-11-08 22:13:23,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 22:13:23,086 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.0) internal successors, (105), 16 states have internal predecessors, (105), 6 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 5 states have call predecessors, (80), 6 states have call successors, (80) Word has length 217 [2024-11-08 22:13:23,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:13:23,092 INFO L225 Difference]: With dead ends: 1626 [2024-11-08 22:13:23,093 INFO L226 Difference]: Without dead ends: 878 [2024-11-08 22:13:23,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 496 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=1117, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 22:13:23,096 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 858 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 22:13:23,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 919 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 22:13:23,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-11-08 22:13:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 853. [2024-11-08 22:13:23,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 668 states have (on average 1.3817365269461077) internal successors, (923), 675 states have internal predecessors, (923), 165 states have call successors, (165), 19 states have call predecessors, (165), 19 states have return successors, (165), 158 states have call predecessors, (165), 165 states have call successors, (165) [2024-11-08 22:13:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1253 transitions. [2024-11-08 22:13:23,211 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1253 transitions. Word has length 217 [2024-11-08 22:13:23,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:13:23,211 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1253 transitions. [2024-11-08 22:13:23,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.0) internal successors, (105), 16 states have internal predecessors, (105), 6 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 5 states have call predecessors, (80), 6 states have call successors, (80) [2024-11-08 22:13:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1253 transitions. [2024-11-08 22:13:23,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-08 22:13:23,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:13:23,215 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:13:23,238 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-08 22:13:23,419 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,SelfDestructingSolverStorable9 [2024-11-08 22:13:23,420 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:13:23,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:13:23,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1993180411, now seen corresponding path program 1 times [2024-11-08 22:13:23,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:13:23,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433887323] [2024-11-08 22:13:23,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:23,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:13:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:13:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:13:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:13:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:13:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:13:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:13:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:13:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:13:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:13:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:13:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:13:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:13:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:13:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:13:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:13:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:13:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:13:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:13:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:13:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:13:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:13:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:13:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:13:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:13:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:13:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:13:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 22:13:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:13:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 22:13:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:13:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 22:13:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:13:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:13:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 22:13:24,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:13:24,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433887323] [2024-11-08 22:13:24,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433887323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:13:24,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:13:24,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 22:13:24,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17662583] [2024-11-08 22:13:24,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:13:24,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 22:13:24,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:13:24,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 22:13:24,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-08 22:13:24,285 INFO L87 Difference]: Start difference. First operand 853 states and 1253 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 22:13:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:13:25,491 INFO L93 Difference]: Finished difference Result 1511 states and 2221 transitions. [2024-11-08 22:13:25,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 22:13:25,492 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 217 [2024-11-08 22:13:25,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:13:25,499 INFO L225 Difference]: With dead ends: 1511 [2024-11-08 22:13:25,499 INFO L226 Difference]: Without dead ends: 885 [2024-11-08 22:13:25,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-08 22:13:25,502 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 258 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:13:25,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 870 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 22:13:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-11-08 22:13:25,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 857. [2024-11-08 22:13:25,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 671 states have (on average 1.3785394932935917) internal successors, (925), 678 states have internal predecessors, (925), 165 states have call successors, (165), 20 states have call predecessors, (165), 20 states have return successors, (165), 158 states have call predecessors, (165), 165 states have call successors, (165) [2024-11-08 22:13:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1255 transitions. [2024-11-08 22:13:25,580 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1255 transitions. Word has length 217 [2024-11-08 22:13:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:13:25,580 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1255 transitions. [2024-11-08 22:13:25,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 22:13:25,581 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1255 transitions. [2024-11-08 22:13:25,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 22:13:25,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:13:25,583 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:13:25,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 22:13:25,583 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:13:25,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:13:25,584 INFO L85 PathProgramCache]: Analyzing trace with hash 632079637, now seen corresponding path program 1 times [2024-11-08 22:13:25,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:13:25,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491498403] [2024-11-08 22:13:25,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:25,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:13:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:13:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:13:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:13:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:13:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:13:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:13:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:13:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:13:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:13:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:13:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:13:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:13:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:13:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:13:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:13:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:13:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:13:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:13:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:13:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:13:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:13:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:13:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:13:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:13:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:13:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:13:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 22:13:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:13:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 22:13:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:13:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 22:13:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:13:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:13:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:27,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 22:13:27,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:13:27,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491498403] [2024-11-08 22:13:27,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491498403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:13:27,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941365536] [2024-11-08 22:13:27,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:27,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:13:27,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:13:27,918 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-08 22:13:27,919 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-08 22:13:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:28,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 22:13:28,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:13:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1076 proven. 57 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2024-11-08 22:13:28,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:13:29,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 22:13:29,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941365536] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:13:29,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 22:13:29,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 26 [2024-11-08 22:13:29,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111246637] [2024-11-08 22:13:29,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 22:13:29,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 22:13:29,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:13:29,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 22:13:29,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2024-11-08 22:13:29,781 INFO L87 Difference]: Start difference. First operand 857 states and 1255 transitions. Second operand has 26 states, 26 states have (on average 5.0) internal successors, (130), 26 states have internal predecessors, (130), 8 states have call successors, (99), 3 states have call predecessors, (99), 7 states have return successors, (99), 8 states have call predecessors, (99), 8 states have call successors, (99) [2024-11-08 22:13:34,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:13:34,827 INFO L93 Difference]: Finished difference Result 3053 states and 4513 transitions. [2024-11-08 22:13:34,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-08 22:13:34,828 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.0) internal successors, (130), 26 states have internal predecessors, (130), 8 states have call successors, (99), 3 states have call predecessors, (99), 7 states have return successors, (99), 8 states have call predecessors, (99), 8 states have call successors, (99) Word has length 218 [2024-11-08 22:13:34,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:13:34,841 INFO L225 Difference]: With dead ends: 3053 [2024-11-08 22:13:34,842 INFO L226 Difference]: Without dead ends: 2321 [2024-11-08 22:13:34,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=776, Invalid=3256, Unknown=0, NotChecked=0, Total=4032 [2024-11-08 22:13:34,846 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1970 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 3035 mSolverCounterSat, 732 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2039 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 3767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 732 IncrementalHoareTripleChecker+Valid, 3035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-08 22:13:34,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2039 Valid, 1788 Invalid, 3767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [732 Valid, 3035 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-08 22:13:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2024-11-08 22:13:34,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 1081. [2024-11-08 22:13:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 841 states have (on average 1.3947681331747919) internal successors, (1173), 850 states have internal predecessors, (1173), 214 states have call successors, (214), 25 states have call predecessors, (214), 25 states have return successors, (214), 205 states have call predecessors, (214), 214 states have call successors, (214) [2024-11-08 22:13:34,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1601 transitions. [2024-11-08 22:13:34,964 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1601 transitions. Word has length 218 [2024-11-08 22:13:34,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:13:34,965 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1601 transitions. [2024-11-08 22:13:34,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.0) internal successors, (130), 26 states have internal predecessors, (130), 8 states have call successors, (99), 3 states have call predecessors, (99), 7 states have return successors, (99), 8 states have call predecessors, (99), 8 states have call successors, (99) [2024-11-08 22:13:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1601 transitions. [2024-11-08 22:13:34,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-08 22:13:34,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:13:34,968 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:13:34,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 22:13:35,169 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-08 22:13:35,169 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:13:35,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:13:35,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1148146719, now seen corresponding path program 1 times [2024-11-08 22:13:35,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:13:35,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557195978] [2024-11-08 22:13:35,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:35,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:13:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:13:35,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [956454131] [2024-11-08 22:13:35,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:35,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:13:35,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:13:35,274 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-08 22:13:35,275 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-08 22:13:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:13:35,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:13:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:13:35,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:13:35,690 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:13:35,691 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:13:35,704 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-08 22:13:35,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:13:35,897 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:13:36,069 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:13:36,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:13:36 BoogieIcfgContainer [2024-11-08 22:13:36,074 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:13:36,074 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:13:36,074 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:13:36,074 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:13:36,075 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:13:07" (3/4) ... [2024-11-08 22:13:36,078 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:13:36,079 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:13:36,080 INFO L158 Benchmark]: Toolchain (without parser) took 29420.73ms. Allocated memory was 172.0MB in the beginning and 528.5MB in the end (delta: 356.5MB). Free memory was 100.6MB in the beginning and 213.2MB in the end (delta: -112.6MB). Peak memory consumption was 243.9MB. Max. memory is 16.1GB. [2024-11-08 22:13:36,080 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 172.0MB. Free memory is still 146.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:13:36,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.19ms. Allocated memory is still 172.0MB. Free memory was 100.4MB in the beginning and 129.7MB in the end (delta: -29.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:13:36,081 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.62ms. Allocated memory is still 172.0MB. Free memory was 129.7MB in the beginning and 126.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:13:36,081 INFO L158 Benchmark]: Boogie Preprocessor took 70.04ms. Allocated memory is still 172.0MB. Free memory was 126.0MB in the beginning and 121.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:13:36,082 INFO L158 Benchmark]: RCFGBuilder took 677.94ms. Allocated memory is still 172.0MB. Free memory was 121.9MB in the beginning and 90.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 22:13:36,082 INFO L158 Benchmark]: TraceAbstraction took 28175.33ms. Allocated memory was 172.0MB in the beginning and 528.5MB in the end (delta: 356.5MB). Free memory was 89.8MB in the beginning and 213.2MB in the end (delta: -123.3MB). Peak memory consumption was 236.3MB. Max. memory is 16.1GB. [2024-11-08 22:13:36,082 INFO L158 Benchmark]: Witness Printer took 5.56ms. Allocated memory is still 528.5MB. Free memory is still 213.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:13:36,083 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.21ms. Allocated memory is still 172.0MB. Free memory is still 146.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 422.19ms. Allocated memory is still 172.0MB. Free memory was 100.4MB in the beginning and 129.7MB in the end (delta: -29.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.62ms. Allocated memory is still 172.0MB. Free memory was 129.7MB in the beginning and 126.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.04ms. Allocated memory is still 172.0MB. Free memory was 126.0MB in the beginning and 121.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 677.94ms. Allocated memory is still 172.0MB. Free memory was 121.9MB in the beginning and 90.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 28175.33ms. Allocated memory was 172.0MB in the beginning and 528.5MB in the end (delta: 356.5MB). Free memory was 89.8MB in the beginning and 213.2MB in the end (delta: -123.3MB). Peak memory consumption was 236.3MB. Max. memory is 16.1GB. * Witness Printer took 5.56ms. Allocated memory is still 528.5MB. Free memory is still 213.2MB. 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: 19]: 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 someBinaryDOUBLEComparisonOperation at line 202, overapproximation of bitwiseOr at line 66, overapproximation of someBinaryArithmeticDOUBLEoperation at line 136. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 15.8; [L23] double var_1_4 = 10.5; [L24] double var_1_5 = 1.55; [L25] signed char var_1_8 = -10; [L26] signed char var_1_10 = -16; [L27] signed char var_1_11 = -4; [L28] signed char var_1_12 = -16; [L29] double var_1_13 = 128.55; [L30] double var_1_14 = 2.3; [L31] double var_1_15 = 4.8; [L32] unsigned long int var_1_16 = 0; [L33] signed long int var_1_17 = 5; [L34] signed long int var_1_18 = 256; [L35] unsigned long int var_1_19 = 50; [L36] unsigned long int var_1_20 = 1; [L37] signed short int var_1_21 = -50; [L38] unsigned char var_1_23 = 1; [L39] unsigned char var_1_24 = 0; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_28 = 0; [L42] unsigned char var_1_29 = 0; [L43] unsigned char var_1_30 = 1; [L44] unsigned long int var_1_31 = 200; [L45] unsigned char var_1_35 = 32; [L46] unsigned char var_1_36 = 10; [L47] double var_1_37 = 15.5; [L48] signed long int var_1_39 = -10; [L49] unsigned long int var_1_42 = 10000; [L50] unsigned long int var_1_43 = 4251471014; [L51] signed short int var_1_44 = 64; [L52] unsigned char var_1_45 = 1; [L53] unsigned long int var_1_46 = 25; [L54] signed long int var_1_47 = -50; [L55] unsigned char var_1_48 = 0; [L56] double var_1_49 = 16.5; [L57] signed char last_1_var_1_8 = -10; [L58] signed short int last_1_var_1_21 = -50; [L59] unsigned char last_1_var_1_23 = 1; VAL [isInitial=0, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_4=21/2, var_1_5=31/20, var_1_8=-10] [L206] isInitial = 1 [L207] FCALL initially() [L208] COND TRUE 1 [L209] CALL updateLastVariables() [L197] last_1_var_1_8 = var_1_8 [L198] last_1_var_1_21 = var_1_21 [L199] last_1_var_1_23 = var_1_23 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_4=21/2, var_1_5=31/20, var_1_8=-10] [L209] RET updateLastVariables() [L210] CALL updateVariables() [L144] var_1_4 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=31/20, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=31/20, var_1_8=-10] [L145] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=31/20, var_1_8=-10] [L146] var_1_5 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L147] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L148] var_1_10 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L149] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L150] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L150] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L151] var_1_11 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_11 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L152] RET assume_abort_if_not(var_1_11 >= -31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L153] CALL assume_abort_if_not(var_1_11 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L153] RET assume_abort_if_not(var_1_11 <= 32) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L154] var_1_12 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L155] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L156] CALL assume_abort_if_not(var_1_12 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L156] RET assume_abort_if_not(var_1_12 <= 31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L157] var_1_14 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L158] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L159] var_1_15 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L160] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L161] var_1_17 = __VERIFIER_nondet_long() [L162] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L162] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L163] CALL assume_abort_if_not(var_1_17 <= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L163] RET assume_abort_if_not(var_1_17 <= 1073741824) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L164] var_1_18 = __VERIFIER_nondet_long() [L165] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L165] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L166] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L166] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L167] var_1_19 = __VERIFIER_nondet_ulong() [L168] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L168] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L169] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L169] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L170] var_1_20 = __VERIFIER_nondet_ulong() [L171] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L171] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L172] CALL assume_abort_if_not(var_1_20 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L172] RET assume_abort_if_not(var_1_20 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L173] var_1_24 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L174] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L175] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L175] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L176] var_1_28 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L177] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L178] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L178] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L179] var_1_29 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L180] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L181] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L181] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L182] var_1_30 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L183] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L184] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L184] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L185] var_1_36 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L186] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L187] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L187] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L188] var_1_43 = __VERIFIER_nondet_ulong() [L189] CALL assume_abort_if_not(var_1_43 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L189] RET assume_abort_if_not(var_1_43 >= 3221225470) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L190] CALL assume_abort_if_not(var_1_43 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L190] RET assume_abort_if_not(var_1_43 <= 4294967294) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L191] var_1_45 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L192] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L193] CALL assume_abort_if_not(var_1_45 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L193] RET assume_abort_if_not(var_1_45 <= 255) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L194] CALL assume_abort_if_not(var_1_45 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L194] RET assume_abort_if_not(var_1_45 != 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L210] RET updateVariables() [L211] CALL step() [L63] COND FALSE !(32 >= var_1_18) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] EXPR 16u | var_1_8 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] EXPR (((16u | var_1_8)) > (var_1_18)) ? ((16u | var_1_8)) : (var_1_18) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] EXPR 16u | var_1_8 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] EXPR (((16u | var_1_8)) > (var_1_18)) ? ((16u | var_1_8)) : (var_1_18) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] COND FALSE !(var_1_19 > (((((16u | var_1_8)) > (var_1_18)) ? ((16u | var_1_8)) : (var_1_18)))) [L71] EXPR var_1_17 & -10 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L71] COND FALSE !((var_1_17 & -10) < var_1_19) [L80] var_1_37 = var_1_5 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=2, var_1_8=-10] [L81] COND FALSE !(! var_1_30) [L84] var_1_39 = (var_1_16 + ((((var_1_36) > ((var_1_8 + var_1_12))) ? (var_1_36) : ((var_1_8 + var_1_12))))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=2, var_1_8=-10] [L86] var_1_42 = ((var_1_43 - var_1_36) - var_1_21) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=2, var_1_8=-10] [L87] COND TRUE (var_1_18 / var_1_45) > ((((var_1_36) < 0 ) ? -(var_1_36) : (var_1_36))) [L88] var_1_44 = ((((var_1_45) < ((((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) < 0 ) ? -((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) : ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) ? (var_1_45) : ((((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) < 0 ) ? -((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) : ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))))))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=2, var_1_8=-10] [L92] var_1_46 = var_1_43 [L93] var_1_47 = var_1_8 [L94] var_1_48 = var_1_30 [L95] var_1_49 = var_1_15 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-10] [L96] COND TRUE last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-10] [L97] COND TRUE \read(last_1_var_1_23) [L98] var_1_8 = (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L103] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L104] COND FALSE !(128u >= var_1_8) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L111] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L115] COND TRUE var_1_8 >= ((1329162249 - var_1_17) - var_1_18) [L116] var_1_16 = (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=4294967296, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L124] COND FALSE !(((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=4294967296, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L133] unsigned char stepLocal_1 = var_1_23; [L134] signed char stepLocal_0 = var_1_8; VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, stepLocal_0=-1, stepLocal_1=0, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=4294967296, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L135] COND TRUE stepLocal_0 >= var_1_16 [L136] var_1_1 = (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, stepLocal_1=0, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=4294967296, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L211] RET step() [L212] CALL, EXPR property() [L202] EXPR (((((var_1_8 >= var_1_16) ? (var_1_1 == ((double) (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) : ((var_1_23 || var_1_23) ? (var_1_1 == ((double) 128.75)) : 1)) && ((last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8)))) ? (last_1_var_1_23 ? (var_1_8 == ((signed char) (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))))) : 1) : (var_1_8 == ((signed char) var_1_12)))) && ((128u >= var_1_8) ? ((! var_1_23) ? (var_1_13 == ((double) ((var_1_14 - var_1_15) + 0.25))) : (var_1_13 == ((double) var_1_14))) : (var_1_23 ? (var_1_13 == ((double) var_1_5)) : 1))) && ((var_1_8 >= ((1329162249 - var_1_17) - var_1_18)) ? (var_1_16 == ((unsigned long int) (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20))) : (var_1_23 ? (var_1_16 == ((unsigned long int) var_1_18)) : (var_1_16 == ((unsigned long int) var_1_19))))) && ((((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) ? ((var_1_11 >= (var_1_18 & var_1_16)) ? (var_1_21 == ((signed short int) 8)) : ((var_1_19 < var_1_8) ? (var_1_21 == ((signed short int) 64)) : 1)) : 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=4294967296, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L202-L203] return ((((((var_1_8 >= var_1_16) ? (var_1_1 == ((double) (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) : ((var_1_23 || var_1_23) ? (var_1_1 == ((double) 128.75)) : 1)) && ((last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8)))) ? (last_1_var_1_23 ? (var_1_8 == ((signed char) (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))))) : 1) : (var_1_8 == ((signed char) var_1_12)))) && ((128u >= var_1_8) ? ((! var_1_23) ? (var_1_13 == ((double) ((var_1_14 - var_1_15) + 0.25))) : (var_1_13 == ((double) var_1_14))) : (var_1_23 ? (var_1_13 == ((double) var_1_5)) : 1))) && ((var_1_8 >= ((1329162249 - var_1_17) - var_1_18)) ? (var_1_16 == ((unsigned long int) (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20))) : (var_1_23 ? (var_1_16 == ((unsigned long int) var_1_18)) : (var_1_16 == ((unsigned long int) var_1_19))))) && ((((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) ? ((var_1_11 >= (var_1_18 & var_1_16)) ? (var_1_21 == ((signed short int) 8)) : ((var_1_19 < var_1_8) ? (var_1_21 == ((signed short int) 64)) : 1)) : 1)) && (var_1_23 == ((unsigned char) var_1_24)) ; [L212] RET, EXPR property() [L212] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=4294967296, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=4294967296, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.9s, OverallIterations: 13, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5303 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5208 mSDsluCounter, 7947 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5677 mSDsCounter, 1657 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7026 IncrementalHoareTripleChecker+Invalid, 8683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1657 mSolverCounterUnsat, 2270 mSDtfsCounter, 7026 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2261 GetRequests, 2108 SyntacticMatches, 3 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1401 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1556occurred in iteration=4, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 2002 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 3679 NumberOfCodeBlocks, 3679 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3873 ConstructedInterpolants, 0 QuantifiedInterpolants, 18373 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1499 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 18 InterpolantComputations, 9 PerfectInterpolantSequences, 37629/38016 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-08 22:13:36,191 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.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 2ed23d94a5510a02522217ac25d44c0be6f4c30553346d9a869cec0689948ba9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:13:38,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:13:38,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:13:38,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:13:38,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:13:38,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:13:38,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:13:38,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:13:38,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:13:38,573 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:13:38,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:13:38,573 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:13:38,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:13:38,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:13:38,578 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:13:38,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:13:38,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:13:38,579 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:13:38,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:13:38,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:13:38,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:13:38,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:13:38,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:13:38,584 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:13:38,585 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:13:38,585 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:13:38,585 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:13:38,585 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:13:38,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:13:38,586 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:13:38,586 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:13:38,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:13:38,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:13:38,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:13:38,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:13:38,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:13:38,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:13:38,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:13:38,591 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:13:38,591 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:13:38,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:13:38,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:13:38,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:13:38,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:13:38,594 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 -> 2ed23d94a5510a02522217ac25d44c0be6f4c30553346d9a869cec0689948ba9 [2024-11-08 22:13:38,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:13:38,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:13:38,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:13:38,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:13:38,946 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:13:38,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-11-08 22:13:40,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:13:40,841 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:13:40,842 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-11-08 22:13:40,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f37180c9e/25fb0dec71df44a19ea7a95139076cbe/FLAGbb8b8b282 [2024-11-08 22:13:40,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f37180c9e/25fb0dec71df44a19ea7a95139076cbe [2024-11-08 22:13:40,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:13:40,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:13:40,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:13:40,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:13:40,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:13:40,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:13:40" (1/1) ... [2024-11-08 22:13:40,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1036f51d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:40, skipping insertion in model container [2024-11-08 22:13:40,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:13:40" (1/1) ... [2024-11-08 22:13:40,927 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:13:41,128 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i[919,932] [2024-11-08 22:13:41,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:13:41,246 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:13:41,259 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i[919,932] [2024-11-08 22:13:41,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:13:41,337 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:13:41,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:41 WrapperNode [2024-11-08 22:13:41,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:13:41,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:13:41,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:13:41,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:13:41,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:41" (1/1) ... [2024-11-08 22:13:41,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:41" (1/1) ... [2024-11-08 22:13:41,402 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-11-08 22:13:41,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:13:41,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:13:41,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:13:41,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:13:41,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:41" (1/1) ... [2024-11-08 22:13:41,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:41" (1/1) ... [2024-11-08 22:13:41,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:41" (1/1) ... [2024-11-08 22:13:41,457 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-08 22:13:41,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:41" (1/1) ... [2024-11-08 22:13:41,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:41" (1/1) ... [2024-11-08 22:13:41,477 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:41" (1/1) ... [2024-11-08 22:13:41,483 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:41" (1/1) ... [2024-11-08 22:13:41,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:41" (1/1) ... [2024-11-08 22:13:41,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:41" (1/1) ... [2024-11-08 22:13:41,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:13:41,501 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:13:41,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:13:41,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:13:41,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:41" (1/1) ... [2024-11-08 22:13:41,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:13:41,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:13:41,540 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-08 22:13:41,544 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-08 22:13:41,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:13:41,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:13:41,589 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:13:41,589 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:13:41,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:13:41,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:13:41,690 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:13:41,694 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:13:45,697 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 22:13:45,698 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:13:45,715 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:13:45,715 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:13:45,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:13:45 BoogieIcfgContainer [2024-11-08 22:13:45,716 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:13:45,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:13:45,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:13:45,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:13:45,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:13:40" (1/3) ... [2024-11-08 22:13:45,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571a23ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:13:45, skipping insertion in model container [2024-11-08 22:13:45,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:13:41" (2/3) ... [2024-11-08 22:13:45,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571a23ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:13:45, skipping insertion in model container [2024-11-08 22:13:45,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:13:45" (3/3) ... [2024-11-08 22:13:45,728 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-11-08 22:13:45,746 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:13:45,746 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:13:45,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:13:45,817 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;@7ac258c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:13:45,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:13:45,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 22:13:45,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 22:13:45,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:13:45,842 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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, 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-08 22:13:45,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:13:45,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:13:45,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1816007015, now seen corresponding path program 1 times [2024-11-08 22:13:45,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:13:45,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915786594] [2024-11-08 22:13:45,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:45,867 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-08 22:13:45,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:13:45,869 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-08 22:13:45,883 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-08 22:13:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:46,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:13:46,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:13:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 1508 trivial. 0 not checked. [2024-11-08 22:13:46,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:13:46,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:13:46,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915786594] [2024-11-08 22:13:46,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915786594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:13:46,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:13:46,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:13:46,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507750791] [2024-11-08 22:13:46,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:13:46,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:13:46,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:13:46,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:13:46,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:13:46,409 INFO L87 Difference]: Start difference. First operand has 96 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 22:13:46,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:13:46,443 INFO L93 Difference]: Finished difference Result 184 states and 329 transitions. [2024-11-08 22:13:46,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:13:46,446 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 208 [2024-11-08 22:13:46,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:13:46,453 INFO L225 Difference]: With dead ends: 184 [2024-11-08 22:13:46,453 INFO L226 Difference]: Without dead ends: 91 [2024-11-08 22:13:46,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 207 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-08 22:13:46,461 INFO L432 NwaCegarLoop]: 142 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, 142 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-08 22:13:46,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:13:46,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-08 22:13:46,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-08 22:13:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 22:13:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 142 transitions. [2024-11-08 22:13:46,512 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 142 transitions. Word has length 208 [2024-11-08 22:13:46,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:13:46,517 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 142 transitions. [2024-11-08 22:13:46,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 22:13:46,517 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 142 transitions. [2024-11-08 22:13:46,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 22:13:46,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:13:46,525 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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, 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-08 22:13:46,540 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-08 22:13:46,726 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-08 22:13:46,727 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:13:46,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:13:46,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1638122025, now seen corresponding path program 1 times [2024-11-08 22:13:46,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:13:46,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371765974] [2024-11-08 22:13:46,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:46,729 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-08 22:13:46,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:13:46,732 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-08 22:13:46,734 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-08 22:13:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:47,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 22:13:47,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:13:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 848 proven. 24 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2024-11-08 22:13:47,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:13:47,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 72 proven. 24 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 22:13:47,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:13:47,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371765974] [2024-11-08 22:13:47,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371765974] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:13:47,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 22:13:47,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-08 22:13:47,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791038204] [2024-11-08 22:13:47,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 22:13:47,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 22:13:47,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:13:47,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 22:13:47,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:13:47,939 INFO L87 Difference]: Start difference. First operand 91 states and 142 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-08 22:13:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:13:48,486 INFO L93 Difference]: Finished difference Result 185 states and 286 transitions. [2024-11-08 22:13:48,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 22:13:48,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 208 [2024-11-08 22:13:48,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:13:48,490 INFO L225 Difference]: With dead ends: 185 [2024-11-08 22:13:48,490 INFO L226 Difference]: Without dead ends: 97 [2024-11-08 22:13:48,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 408 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-08 22:13:48,492 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 87 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 22:13:48,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 244 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 22:13:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-08 22:13:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-11-08 22:13:48,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 22:13:48,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 144 transitions. [2024-11-08 22:13:48,517 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 144 transitions. Word has length 208 [2024-11-08 22:13:48,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:13:48,518 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 144 transitions. [2024-11-08 22:13:48,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-08 22:13:48,518 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 144 transitions. [2024-11-08 22:13:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 22:13:48,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:13:48,521 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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, 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-08 22:13:48,536 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-08 22:13:48,722 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-08 22:13:48,723 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:13:48,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:13:48,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1635776917, now seen corresponding path program 1 times [2024-11-08 22:13:48,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:13:48,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927610101] [2024-11-08 22:13:48,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:48,725 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-08 22:13:48,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:13:48,726 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-08 22:13:48,728 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-08 22:13:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:49,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 22:13:49,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:13:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 22:13:50,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:13:50,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:13:50,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927610101] [2024-11-08 22:13:50,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927610101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:13:50,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:13:50,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:13:50,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976279061] [2024-11-08 22:13:50,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:13:50,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:13:50,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:13:50,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:13:50,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:13:50,921 INFO L87 Difference]: Start difference. First operand 95 states and 144 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 22:13:53,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:13:54,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:13:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:13:54,746 INFO L93 Difference]: Finished difference Result 297 states and 453 transitions. [2024-11-08 22:13:54,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:13:54,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-11-08 22:13:54,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:13:54,778 INFO L225 Difference]: With dead ends: 297 [2024-11-08 22:13:54,778 INFO L226 Difference]: Without dead ends: 205 [2024-11-08 22:13:54,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 205 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-08 22:13:54,780 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 107 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-08 22:13:54,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 398 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-08 22:13:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-08 22:13:54,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 184. [2024-11-08 22:13:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 113 states have (on average 1.3097345132743363) internal successors, (148), 113 states have internal predecessors, (148), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 22:13:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 280 transitions. [2024-11-08 22:13:54,830 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 280 transitions. Word has length 208 [2024-11-08 22:13:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:13:54,831 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 280 transitions. [2024-11-08 22:13:54,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 22:13:54,831 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 280 transitions. [2024-11-08 22:13:54,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 22:13:54,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:13:54,834 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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, 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-08 22:13:54,849 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-08 22:13:55,038 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-08 22:13:55,039 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:13:55,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:13:55,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1002039159, now seen corresponding path program 1 times [2024-11-08 22:13:55,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:13:55,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068243827] [2024-11-08 22:13:55,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:55,041 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-08 22:13:55,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:13:55,044 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-08 22:13:55,045 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-08 22:13:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:13:55,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 22:13:55,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:13:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1058 proven. 39 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2024-11-08 22:13:55,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:13:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 57 proven. 39 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 22:13:56,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:13:56,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068243827] [2024-11-08 22:13:56,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068243827] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:13:56,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 22:13:56,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-08 22:13:56,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302205254] [2024-11-08 22:13:56,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 22:13:56,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 22:13:56,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:13:56,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 22:13:56,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 22:13:56,104 INFO L87 Difference]: Start difference. First operand 184 states and 280 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-08 22:13:58,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:13:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:13:59,388 INFO L93 Difference]: Finished difference Result 465 states and 692 transitions. [2024-11-08 22:13:59,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 22:13:59,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 209 [2024-11-08 22:13:59,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:13:59,396 INFO L225 Difference]: With dead ends: 465 [2024-11-08 22:13:59,396 INFO L226 Difference]: Without dead ends: 284 [2024-11-08 22:13:59,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 410 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-08 22:13:59,399 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 145 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:13:59,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 444 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 22:13:59,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-08 22:13:59,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 192. [2024-11-08 22:13:59,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 119 states have (on average 1.2521008403361344) internal successors, (149), 119 states have internal predecessors, (149), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 22:13:59,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 281 transitions. [2024-11-08 22:13:59,441 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 281 transitions. Word has length 209 [2024-11-08 22:13:59,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:13:59,441 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 281 transitions. [2024-11-08 22:13:59,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-08 22:13:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 281 transitions. [2024-11-08 22:13:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 22:13:59,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:13:59,444 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 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, 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, 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-08 22:13:59,462 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-08 22:13:59,644 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-08 22:13:59,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:13:59,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:13:59,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1682097529, now seen corresponding path program 1 times [2024-11-08 22:13:59,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:13:59,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864818986] [2024-11-08 22:13:59,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:13:59,649 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-08 22:13:59,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:13:59,653 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-08 22:13:59,654 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-08 22:14:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:14:00,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 22:14:00,030 INFO L278 TraceCheckSpWp]: Computing forward predicates...