./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-11.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_operatoramount_amount100_file-11.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 8b670c0ce186fd09c40b80582419dd7d06ef4a420fd0c29de5d521d6799e6a1a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:21:03,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:21:03,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:21:03,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:21:03,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:21:03,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:21:03,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:21:03,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:21:03,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:21:03,476 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:21:03,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:21:03,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:21:03,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:21:03,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:21:03,478 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:21:03,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:21:03,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:21:03,481 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:21:03,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:21:03,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:21:03,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:21:03,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:21:03,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:21:03,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:21:03,487 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:21:03,488 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:21:03,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:21:03,488 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:21:03,489 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:21:03,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:21:03,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:21:03,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:21:03,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:21:03,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:21:03,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:21:03,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:21:03,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:21:03,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:21:03,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:21:03,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:21:03,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:21:03,493 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:21:03,493 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 -> 8b670c0ce186fd09c40b80582419dd7d06ef4a420fd0c29de5d521d6799e6a1a [2024-11-09 00:21:03,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:21:03,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:21:03,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:21:03,769 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:21:03,769 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:21:03,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-11.i [2024-11-09 00:21:05,249 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:21:05,465 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:21:05,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-11.i [2024-11-09 00:21:05,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51fded14b/7e110b572e7648b3beaf5d7123a7a5a8/FLAG4acdb6825 [2024-11-09 00:21:05,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51fded14b/7e110b572e7648b3beaf5d7123a7a5a8 [2024-11-09 00:21:05,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:21:05,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:21:05,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:21:05,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:21:05,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:21:05,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:21:05" (1/1) ... [2024-11-09 00:21:05,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e54f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:05, skipping insertion in model container [2024-11-09 00:21:05,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:21:05" (1/1) ... [2024-11-09 00:21:05,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:21:05,805 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_operatoramount_amount100_file-11.i[916,929] [2024-11-09 00:21:05,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:21:05,899 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:21:05,913 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_operatoramount_amount100_file-11.i[916,929] [2024-11-09 00:21:05,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:21:05,988 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:21:05,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:05 WrapperNode [2024-11-09 00:21:05,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:21:05,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:21:05,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:21:05,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:21:05,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:05" (1/1) ... [2024-11-09 00:21:06,010 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:05" (1/1) ... [2024-11-09 00:21:06,058 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 292 [2024-11-09 00:21:06,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:21:06,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:21:06,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:21:06,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:21:06,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:05" (1/1) ... [2024-11-09 00:21:06,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:05" (1/1) ... [2024-11-09 00:21:06,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:05" (1/1) ... [2024-11-09 00:21:06,103 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:21:06,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:05" (1/1) ... [2024-11-09 00:21:06,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:05" (1/1) ... [2024-11-09 00:21:06,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:05" (1/1) ... [2024-11-09 00:21:06,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:05" (1/1) ... [2024-11-09 00:21:06,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:05" (1/1) ... [2024-11-09 00:21:06,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:05" (1/1) ... [2024-11-09 00:21:06,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:21:06,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:21:06,148 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:21:06,148 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:21:06,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:05" (1/1) ... [2024-11-09 00:21:06,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:21:06,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:21:06,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:21:06,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:21:06,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:21:06,248 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:21:06,248 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:21:06,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:21:06,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:21:06,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:21:06,336 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:21:06,339 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:21:07,071 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-09 00:21:07,072 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:21:07,100 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:21:07,100 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:21:07,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:21:07 BoogieIcfgContainer [2024-11-09 00:21:07,101 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:21:07,103 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:21:07,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:21:07,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:21:07,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:21:05" (1/3) ... [2024-11-09 00:21:07,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa010b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:21:07, skipping insertion in model container [2024-11-09 00:21:07,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:05" (2/3) ... [2024-11-09 00:21:07,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa010b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:21:07, skipping insertion in model container [2024-11-09 00:21:07,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:21:07" (3/3) ... [2024-11-09 00:21:07,112 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-11.i [2024-11-09 00:21:07,132 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:21:07,133 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:21:07,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:21:07,240 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;@2bf61f76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:21:07,241 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:21:07,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 92 states have (on average 1.5108695652173914) internal successors, (139), 93 states have internal predecessors, (139), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:21:07,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 00:21:07,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:07,269 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:21:07,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:07,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:07,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1791764808, now seen corresponding path program 1 times [2024-11-09 00:21:07,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:21:07,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186585837] [2024-11-09 00:21:07,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:07,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:21:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:21:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:21:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:21:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:21:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:21:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:21:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:21:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:21:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:21:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:21:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:21:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:21:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:21:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:21:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:21:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:21:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:21:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:21:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:21:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,940 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:21:07,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:21:07,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186585837] [2024-11-09 00:21:07,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186585837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:21:07,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:21:07,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:21:07,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412170107] [2024-11-09 00:21:07,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:21:07,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:21:07,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:21:07,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:21:07,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:21:07,977 INFO L87 Difference]: Start difference. First operand has 115 states, 92 states have (on average 1.5108695652173914) internal successors, (139), 93 states have internal predecessors, (139), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:21:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:08,026 INFO L93 Difference]: Finished difference Result 223 states and 372 transitions. [2024-11-09 00:21:08,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:21:08,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 148 [2024-11-09 00:21:08,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:08,039 INFO L225 Difference]: With dead ends: 223 [2024-11-09 00:21:08,040 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 00:21:08,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:21:08,047 INFO L432 NwaCegarLoop]: 172 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, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:08,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:21:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 00:21:08,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-09 00:21:08,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 89 states have internal predecessors, (132), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:21:08,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 172 transitions. [2024-11-09 00:21:08,121 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 172 transitions. Word has length 148 [2024-11-09 00:21:08,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:08,122 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 172 transitions. [2024-11-09 00:21:08,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:21:08,122 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2024-11-09 00:21:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 00:21:08,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:08,129 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:21:08,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:21:08,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:08,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:08,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1571453376, now seen corresponding path program 1 times [2024-11-09 00:21:08,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:21:08,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981346076] [2024-11-09 00:21:08,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:08,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:21:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:21:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:21:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:21:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:21:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:21:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:21:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:21:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:21:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:21:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:21:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:21:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:21:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:21:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:21:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:21:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:21:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:21:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:21:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:21:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:21:08,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:21:08,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981346076] [2024-11-09 00:21:08,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981346076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:21:08,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:21:08,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:21:08,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994974288] [2024-11-09 00:21:08,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:21:08,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:21:08,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:21:08,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:21:08,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:21:08,690 INFO L87 Difference]: Start difference. First operand 111 states and 172 transitions. 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:08,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:08,745 INFO L93 Difference]: Finished difference Result 220 states and 343 transitions. [2024-11-09 00:21:08,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:21:08,750 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2024-11-09 00:21:08,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:08,752 INFO L225 Difference]: With dead ends: 220 [2024-11-09 00:21:08,752 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 00:21:08,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:21:08,757 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 4 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:08,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 334 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:21:08,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 00:21:08,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-09 00:21:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.4777777777777779) internal successors, (133), 90 states have internal predecessors, (133), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:21:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2024-11-09 00:21:08,774 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 148 [2024-11-09 00:21:08,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:08,776 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2024-11-09 00:21:08,776 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2024-11-09 00:21:08,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 00:21:08,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:08,781 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:21:08,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:21:08,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:08,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:08,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1900778094, now seen corresponding path program 1 times [2024-11-09 00:21:08,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:21:08,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288646203] [2024-11-09 00:21:08,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:08,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:21:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:21:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:21:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:21:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:21:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:21:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:21:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:21:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:21:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:21:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:21:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:21:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:21:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:08,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:21:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:21:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:21:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:21:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:21:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:21:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:21:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:21:09,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:21:09,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288646203] [2024-11-09 00:21:09,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288646203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:21:09,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:21:09,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:21:09,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359486701] [2024-11-09 00:21:09,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:21:09,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:21:09,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:21:09,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:21:09,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:21:09,029 INFO L87 Difference]: Start difference. First operand 112 states and 173 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:09,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:09,082 INFO L93 Difference]: Finished difference Result 261 states and 401 transitions. [2024-11-09 00:21:09,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:21:09,086 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 149 [2024-11-09 00:21:09,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:09,088 INFO L225 Difference]: With dead ends: 261 [2024-11-09 00:21:09,088 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 00:21:09,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:21:09,093 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 58 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:09,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 372 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:21:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 00:21:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 119. [2024-11-09 00:21:09,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.4845360824742269) internal successors, (144), 97 states have internal predecessors, (144), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:21:09,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 184 transitions. [2024-11-09 00:21:09,116 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 184 transitions. Word has length 149 [2024-11-09 00:21:09,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:09,117 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 184 transitions. [2024-11-09 00:21:09,117 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:09,117 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 184 transitions. [2024-11-09 00:21:09,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 00:21:09,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:09,122 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:21:09,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:21:09,123 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:09,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:09,123 INFO L85 PathProgramCache]: Analyzing trace with hash -312430192, now seen corresponding path program 1 times [2024-11-09 00:21:09,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:21:09,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110574503] [2024-11-09 00:21:09,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:09,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:21:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:21:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:21:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:21:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:21:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:21:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:21:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:21:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:21:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:21:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:21:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:21:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:21:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:21:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:21:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:21:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:21:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:21:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:21:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:21:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:21:09,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:21:09,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110574503] [2024-11-09 00:21:09,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110574503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:21:09,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:21:09,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:21:09,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162784187] [2024-11-09 00:21:09,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:21:09,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:21:09,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:21:09,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:21:09,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:21:09,977 INFO L87 Difference]: Start difference. First operand 119 states and 184 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:10,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:10,535 INFO L93 Difference]: Finished difference Result 573 states and 887 transitions. [2024-11-09 00:21:10,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 00:21:10,536 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 149 [2024-11-09 00:21:10,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:10,540 INFO L225 Difference]: With dead ends: 573 [2024-11-09 00:21:10,540 INFO L226 Difference]: Without dead ends: 457 [2024-11-09 00:21:10,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:21:10,543 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 457 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:10,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 949 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 00:21:10,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-09 00:21:10,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 312. [2024-11-09 00:21:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 269 states have (on average 1.5315985130111525) internal successors, (412), 269 states have internal predecessors, (412), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 00:21:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 492 transitions. [2024-11-09 00:21:10,599 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 492 transitions. Word has length 149 [2024-11-09 00:21:10,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:10,600 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 492 transitions. [2024-11-09 00:21:10,600 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:10,600 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 492 transitions. [2024-11-09 00:21:10,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 00:21:10,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:10,603 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:21:10,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 00:21:10,603 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:10,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1007012684, now seen corresponding path program 1 times [2024-11-09 00:21:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:21:10,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146936537] [2024-11-09 00:21:10,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:10,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:10,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:21:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:10,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:21:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:10,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:21:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:10,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:21:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:10,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:21:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:10,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:21:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:10,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:21:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:10,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:21:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:10,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:21:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:10,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:21:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:11,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:21:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:11,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:21:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:11,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:21:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:11,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:21:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:11,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:21:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:11,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:21:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:11,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:21:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:11,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:21:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:11,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:21:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:11,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:21:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:21:11,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:21:11,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146936537] [2024-11-09 00:21:11,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146936537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:21:11,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:21:11,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 00:21:11,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667944625] [2024-11-09 00:21:11,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:21:11,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:21:11,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:21:11,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:21:11,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:21:11,056 INFO L87 Difference]: Start difference. First operand 312 states and 492 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-09 00:21:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:11,521 INFO L93 Difference]: Finished difference Result 625 states and 965 transitions. [2024-11-09 00:21:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 00:21:11,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 150 [2024-11-09 00:21:11,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:11,527 INFO L225 Difference]: With dead ends: 625 [2024-11-09 00:21:11,527 INFO L226 Difference]: Without dead ends: 509 [2024-11-09 00:21:11,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 00:21:11,531 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 693 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:11,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 835 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 00:21:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-09 00:21:11,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 454. [2024-11-09 00:21:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 386 states have (on average 1.505181347150259) internal successors, (581), 386 states have internal predecessors, (581), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 00:21:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 701 transitions. [2024-11-09 00:21:11,595 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 701 transitions. Word has length 150 [2024-11-09 00:21:11,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:11,595 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 701 transitions. [2024-11-09 00:21:11,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-09 00:21:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 701 transitions. [2024-11-09 00:21:11,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 00:21:11,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:11,599 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:21:11,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 00:21:11,599 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:11,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:11,600 INFO L85 PathProgramCache]: Analyzing trace with hash -584310858, now seen corresponding path program 1 times [2024-11-09 00:21:11,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:21:11,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145596992] [2024-11-09 00:21:11,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:11,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:11,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:21:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:11,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:21:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:11,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:21:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:11,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:21:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:11,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:21:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:21:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:21:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:21:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:21:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:21:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:21:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:21:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:21:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:21:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:21:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:21:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:21:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:21:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:21:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:21:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:21:12,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:21:12,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145596992] [2024-11-09 00:21:12,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145596992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:21:12,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:21:12,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 00:21:12,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001438273] [2024-11-09 00:21:12,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:21:12,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:21:12,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:21:12,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:21:12,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:21:12,098 INFO L87 Difference]: Start difference. First operand 454 states and 701 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:12,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:12,418 INFO L93 Difference]: Finished difference Result 1201 states and 1854 transitions. [2024-11-09 00:21:12,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 00:21:12,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-09 00:21:12,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:12,425 INFO L225 Difference]: With dead ends: 1201 [2024-11-09 00:21:12,426 INFO L226 Difference]: Without dead ends: 750 [2024-11-09 00:21:12,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:21:12,428 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 176 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:12,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 691 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:21:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2024-11-09 00:21:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 523. [2024-11-09 00:21:12,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 432 states have (on average 1.4907407407407407) internal successors, (644), 432 states have internal predecessors, (644), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-09 00:21:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 804 transitions. [2024-11-09 00:21:12,484 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 804 transitions. Word has length 150 [2024-11-09 00:21:12,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:12,485 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 804 transitions. [2024-11-09 00:21:12,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 804 transitions. [2024-11-09 00:21:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 00:21:12,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:12,488 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:21:12,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 00:21:12,488 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:12,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:12,489 INFO L85 PathProgramCache]: Analyzing trace with hash -633232886, now seen corresponding path program 1 times [2024-11-09 00:21:12,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:21:12,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499189853] [2024-11-09 00:21:12,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:12,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:21:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:21:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:21:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:21:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:21:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:12,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:21:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:21:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:21:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:21:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:21:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:21:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:21:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:21:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:21:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:21:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:21:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:21:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:21:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:21:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:21:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:21:13,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:21:13,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499189853] [2024-11-09 00:21:13,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499189853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:21:13,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:21:13,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:21:13,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217519983] [2024-11-09 00:21:13,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:21:13,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:21:13,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:21:13,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:21:13,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:21:13,124 INFO L87 Difference]: Start difference. First operand 523 states and 804 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:13,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:13,464 INFO L93 Difference]: Finished difference Result 1735 states and 2688 transitions. [2024-11-09 00:21:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:21:13,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-09 00:21:13,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:13,472 INFO L225 Difference]: With dead ends: 1735 [2024-11-09 00:21:13,472 INFO L226 Difference]: Without dead ends: 1267 [2024-11-09 00:21:13,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:21:13,475 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 235 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:13,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 538 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:21:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2024-11-09 00:21:13,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1145. [2024-11-09 00:21:13,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 987 states have (on average 1.502532928064843) internal successors, (1483), 987 states have internal predecessors, (1483), 140 states have call successors, (140), 17 states have call predecessors, (140), 17 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-09 00:21:13,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1763 transitions. [2024-11-09 00:21:13,622 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1763 transitions. Word has length 150 [2024-11-09 00:21:13,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:13,623 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1763 transitions. [2024-11-09 00:21:13,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1763 transitions. [2024-11-09 00:21:13,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 00:21:13,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:13,627 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:21:13,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 00:21:13,628 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:13,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:13,628 INFO L85 PathProgramCache]: Analyzing trace with hash -89615343, now seen corresponding path program 1 times [2024-11-09 00:21:13,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:21:13,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047420354] [2024-11-09 00:21:13,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:13,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:21:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:21:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:21:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:21:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:21:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:21:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:21:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:21:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:21:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:21:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:21:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:21:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:21:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:21:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:21:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:21:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:21:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:21:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:21:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:21:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:21:13,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:21:13,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047420354] [2024-11-09 00:21:13,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047420354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:21:13,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:21:13,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:21:13,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131086902] [2024-11-09 00:21:13,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:21:13,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:21:13,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:21:13,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:21:13,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:21:13,884 INFO L87 Difference]: Start difference. First operand 1145 states and 1763 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:14,220 INFO L93 Difference]: Finished difference Result 3058 states and 4732 transitions. [2024-11-09 00:21:14,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:21:14,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2024-11-09 00:21:14,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:14,232 INFO L225 Difference]: With dead ends: 3058 [2024-11-09 00:21:14,232 INFO L226 Difference]: Without dead ends: 1968 [2024-11-09 00:21:14,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:21:14,237 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 238 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:14,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 559 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:21:14,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2024-11-09 00:21:14,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1862. [2024-11-09 00:21:14,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1637 states have (on average 1.5088576664630422) internal successors, (2470), 1637 states have internal predecessors, (2470), 200 states have call successors, (200), 24 states have call predecessors, (200), 24 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2024-11-09 00:21:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2870 transitions. [2024-11-09 00:21:14,391 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2870 transitions. Word has length 152 [2024-11-09 00:21:14,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:14,391 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 2870 transitions. [2024-11-09 00:21:14,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:14,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2870 transitions. [2024-11-09 00:21:14,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-09 00:21:14,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:14,395 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:21:14,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 00:21:14,395 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:14,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:14,396 INFO L85 PathProgramCache]: Analyzing trace with hash -579403484, now seen corresponding path program 1 times [2024-11-09 00:21:14,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:21:14,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534386609] [2024-11-09 00:21:14,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:14,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:21:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:21:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:21:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:21:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:21:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:21:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:21:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:21:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:21:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:21:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:21:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:21:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:21:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:21:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:21:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:21:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:21:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:21:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:21:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:21:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:21:14,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:21:14,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534386609] [2024-11-09 00:21:14,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534386609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:21:14,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:21:14,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:21:14,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375001983] [2024-11-09 00:21:14,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:21:14,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:21:14,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:21:14,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:21:14,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:21:14,884 INFO L87 Difference]: Start difference. First operand 1862 states and 2870 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:15,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:15,205 INFO L93 Difference]: Finished difference Result 4302 states and 6596 transitions. [2024-11-09 00:21:15,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:21:15,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2024-11-09 00:21:15,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:15,218 INFO L225 Difference]: With dead ends: 4302 [2024-11-09 00:21:15,219 INFO L226 Difference]: Without dead ends: 2520 [2024-11-09 00:21:15,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:21:15,224 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 162 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:15,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 433 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:21:15,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2024-11-09 00:21:15,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 2399. [2024-11-09 00:21:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 2174 states have (on average 1.499540018399264) internal successors, (3260), 2174 states have internal predecessors, (3260), 200 states have call successors, (200), 24 states have call predecessors, (200), 24 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2024-11-09 00:21:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 3660 transitions. [2024-11-09 00:21:15,407 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 3660 transitions. Word has length 154 [2024-11-09 00:21:15,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:15,408 INFO L471 AbstractCegarLoop]: Abstraction has 2399 states and 3660 transitions. [2024-11-09 00:21:15,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 3660 transitions. [2024-11-09 00:21:15,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 00:21:15,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:15,411 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:21:15,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 00:21:15,411 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:15,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:15,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2101533465, now seen corresponding path program 1 times [2024-11-09 00:21:15,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:21:15,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139487402] [2024-11-09 00:21:15,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:15,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:21:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:21:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:21:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:21:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:21:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:21:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:21:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:21:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:21:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:21:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:21:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:21:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:21:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:21:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:21:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:21:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:21:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:21:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:21:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:21:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:21:15,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:21:15,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139487402] [2024-11-09 00:21:15,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139487402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:21:15,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:21:15,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:21:15,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723806244] [2024-11-09 00:21:15,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:21:15,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:21:15,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:21:15,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:21:15,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:21:15,697 INFO L87 Difference]: Start difference. First operand 2399 states and 3660 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:15,870 INFO L93 Difference]: Finished difference Result 4792 states and 7313 transitions. [2024-11-09 00:21:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:21:15,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2024-11-09 00:21:15,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:15,883 INFO L225 Difference]: With dead ends: 4792 [2024-11-09 00:21:15,883 INFO L226 Difference]: Without dead ends: 2449 [2024-11-09 00:21:15,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:21:15,890 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 2 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:15,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 502 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:21:15,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2024-11-09 00:21:16,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 2449. [2024-11-09 00:21:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2449 states, 2224 states have (on average 1.4923561151079137) internal successors, (3319), 2224 states have internal predecessors, (3319), 200 states have call successors, (200), 24 states have call predecessors, (200), 24 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2024-11-09 00:21:16,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 3719 transitions. [2024-11-09 00:21:16,059 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 3719 transitions. Word has length 156 [2024-11-09 00:21:16,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:16,060 INFO L471 AbstractCegarLoop]: Abstraction has 2449 states and 3719 transitions. [2024-11-09 00:21:16,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:16,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 3719 transitions. [2024-11-09 00:21:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 00:21:16,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:16,064 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:21:16,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 00:21:16,064 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:16,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:16,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1349428329, now seen corresponding path program 1 times [2024-11-09 00:21:16,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:21:16,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920021520] [2024-11-09 00:21:16,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:16,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:21:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:21:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:21:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:21:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:21:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:21:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:21:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:21:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:21:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:21:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:21:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:21:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:21:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:21:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:21:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:21:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:21:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:21:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:21:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:21:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 00:21:16,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:21:16,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920021520] [2024-11-09 00:21:16,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920021520] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:21:16,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504175886] [2024-11-09 00:21:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:16,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:21:16,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:21:16,465 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:21:16,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 00:21:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:16,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 00:21:16,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:21:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-09 00:21:16,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:21:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 00:21:16,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504175886] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:21:16,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:21:16,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-09 00:21:16,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441802707] [2024-11-09 00:21:16,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:21:16,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:21:16,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:21:16,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:21:16,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:21:16,976 INFO L87 Difference]: Start difference. First operand 2449 states and 3719 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-09 00:21:17,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:17,265 INFO L93 Difference]: Finished difference Result 4886 states and 7387 transitions. [2024-11-09 00:21:17,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 00:21:17,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 156 [2024-11-09 00:21:17,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:17,280 INFO L225 Difference]: With dead ends: 4886 [2024-11-09 00:21:17,280 INFO L226 Difference]: Without dead ends: 2493 [2024-11-09 00:21:17,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:21:17,287 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 234 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:17,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 364 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:21:17,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2024-11-09 00:21:17,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2439. [2024-11-09 00:21:17,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2439 states, 2204 states have (on average 1.471869328493648) internal successors, (3244), 2204 states have internal predecessors, (3244), 200 states have call successors, (200), 34 states have call predecessors, (200), 34 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2024-11-09 00:21:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2439 states and 3644 transitions. [2024-11-09 00:21:17,493 INFO L78 Accepts]: Start accepts. Automaton has 2439 states and 3644 transitions. Word has length 156 [2024-11-09 00:21:17,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:17,494 INFO L471 AbstractCegarLoop]: Abstraction has 2439 states and 3644 transitions. [2024-11-09 00:21:17,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-09 00:21:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 3644 transitions. [2024-11-09 00:21:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 00:21:17,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:17,497 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:21:17,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 00:21:17,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 00:21:17,699 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:17,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:17,700 INFO L85 PathProgramCache]: Analyzing trace with hash -514338169, now seen corresponding path program 1 times [2024-11-09 00:21:17,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:21:17,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190899625] [2024-11-09 00:21:17,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:17,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:21:17,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [45247215] [2024-11-09 00:21:17,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:17,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:21:17,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:21:17,927 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:21:17,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 00:21:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:21:18,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:21:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:21:18,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:21:18,286 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:21:18,287 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:21:18,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 00:21:18,489 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,SelfDestructingSolverStorable11 [2024-11-09 00:21:18,495 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:21:18,628 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:21:18,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:21:18 BoogieIcfgContainer [2024-11-09 00:21:18,631 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:21:18,632 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:21:18,632 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:21:18,632 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:21:18,632 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:21:07" (3/4) ... [2024-11-09 00:21:18,635 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:21:18,637 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:21:18,637 INFO L158 Benchmark]: Toolchain (without parser) took 13130.42ms. Allocated memory was 161.5MB in the beginning and 413.1MB in the end (delta: 251.7MB). Free memory was 88.2MB in the beginning and 213.7MB in the end (delta: -125.5MB). Peak memory consumption was 126.6MB. Max. memory is 16.1GB. [2024-11-09 00:21:18,637 INFO L158 Benchmark]: CDTParser took 6.26ms. Allocated memory is still 161.5MB. Free memory was 124.7MB in the beginning and 135.4MB in the end (delta: -10.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:21:18,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.02ms. Allocated memory is still 161.5MB. Free memory was 88.2MB in the beginning and 120.0MB in the end (delta: -31.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 00:21:18,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.45ms. Allocated memory is still 161.5MB. Free memory was 120.0MB in the beginning and 113.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:21:18,638 INFO L158 Benchmark]: Boogie Preprocessor took 87.24ms. Allocated memory is still 161.5MB. Free memory was 113.7MB in the beginning and 105.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 00:21:18,638 INFO L158 Benchmark]: RCFGBuilder took 953.77ms. Allocated memory is still 161.5MB. Free memory was 105.3MB in the beginning and 63.4MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-09 00:21:18,638 INFO L158 Benchmark]: TraceAbstraction took 11527.89ms. Allocated memory was 161.5MB in the beginning and 413.1MB in the end (delta: 251.7MB). Free memory was 62.7MB in the beginning and 213.7MB in the end (delta: -151.0MB). Peak memory consumption was 102.4MB. Max. memory is 16.1GB. [2024-11-09 00:21:18,639 INFO L158 Benchmark]: Witness Printer took 4.89ms. Allocated memory is still 413.1MB. Free memory is still 213.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:21:18,640 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 6.26ms. Allocated memory is still 161.5MB. Free memory was 124.7MB in the beginning and 135.4MB in the end (delta: -10.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.02ms. Allocated memory is still 161.5MB. Free memory was 88.2MB in the beginning and 120.0MB in the end (delta: -31.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.45ms. Allocated memory is still 161.5MB. Free memory was 120.0MB in the beginning and 113.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.24ms. Allocated memory is still 161.5MB. Free memory was 113.7MB in the beginning and 105.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 953.77ms. Allocated memory is still 161.5MB. Free memory was 105.3MB in the beginning and 63.4MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11527.89ms. Allocated memory was 161.5MB in the beginning and 413.1MB in the end (delta: 251.7MB). Free memory was 62.7MB in the beginning and 213.7MB in the end (delta: -151.0MB). Peak memory consumption was 102.4MB. Max. memory is 16.1GB. * Witness Printer took 4.89ms. Allocated memory is still 413.1MB. Free memory is still 213.7MB. 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 189, overapproximation of bitwiseOr at line 189, overapproximation of bitwiseAnd at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 4.75; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_6 = -4; [L25] double var_1_7 = 49.8; [L26] double var_1_8 = 255.625; [L27] unsigned short int var_1_9 = 10; [L28] unsigned short int var_1_11 = 10000; [L29] signed char var_1_12 = 100; [L30] signed char var_1_13 = 16; [L31] unsigned long int var_1_14 = 4; [L32] signed short int var_1_15 = -16; [L33] unsigned char var_1_17 = 5; [L34] double var_1_18 = 64.75; [L35] double var_1_19 = 99.5; [L36] unsigned long int var_1_20 = 32; [L37] unsigned long int var_1_22 = 32; [L38] unsigned long int var_1_23 = 2461517415; [L39] unsigned long int var_1_24 = 1399914902; [L40] unsigned char var_1_25 = 2; [L41] signed long int var_1_26 = 4; [L42] unsigned char var_1_27 = 0; [L43] unsigned short int var_1_28 = 32; [L44] unsigned short int var_1_29 = 36457; [L45] double last_1_var_1_1 = 4.75; [L46] unsigned short int last_1_var_1_9 = 10; [L47] unsigned short int last_1_var_1_11 = 10000; [L48] unsigned long int last_1_var_1_14 = 4; [L49] signed short int last_1_var_1_15 = -16; [L50] unsigned char last_1_var_1_17 = 5; [L51] double last_1_var_1_18 = 64.75; [L52] unsigned long int last_1_var_1_20 = 32; [L53] unsigned long int last_1_var_1_22 = 32; [L54] unsigned char last_1_var_1_25 = 2; [L55] signed long int last_1_var_1_26 = 4; [L56] unsigned short int last_1_var_1_28 = 32; VAL [isInitial=0, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L193] isInitial = 1 [L194] FCALL initially() [L195] COND TRUE 1 [L196] CALL updateLastVariables() [L175] last_1_var_1_1 = var_1_1 [L176] last_1_var_1_9 = var_1_9 [L177] last_1_var_1_11 = var_1_11 [L178] last_1_var_1_14 = var_1_14 [L179] last_1_var_1_15 = var_1_15 [L180] last_1_var_1_17 = var_1_17 [L181] last_1_var_1_18 = var_1_18 [L182] last_1_var_1_20 = var_1_20 [L183] last_1_var_1_22 = var_1_22 [L184] last_1_var_1_25 = var_1_25 [L185] last_1_var_1_26 = var_1_26 [L186] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L196] RET updateLastVariables() [L197] CALL updateVariables() [L142] var_1_2 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L143] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L144] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L144] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L145] var_1_6 = __VERIFIER_nondet_long() [L146] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L146] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L147] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L147] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L148] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L148] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L149] var_1_7 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_8=2045/8, var_1_9=10] [L150] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_8=2045/8, var_1_9=10] [L151] var_1_8 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L152] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L153] var_1_12 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L154] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L155] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L155] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L156] var_1_13 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L157] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L158] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L158] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L159] var_1_19 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L160] RET assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L161] var_1_23 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L162] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L163] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L163] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L164] var_1_24 = __VERIFIER_nondet_ulong() [L165] CALL assume_abort_if_not(var_1_24 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L165] RET assume_abort_if_not(var_1_24 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L166] CALL assume_abort_if_not(var_1_24 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L166] RET assume_abort_if_not(var_1_24 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L167] var_1_27 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L168] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L169] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L169] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L170] var_1_29 = __VERIFIER_nondet_ushort() [L171] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_9=10] [L171] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_9=10] [L172] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_9=10] [L172] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_9=10] [L197] RET updateVariables() [L198] CALL step() [L60] EXPR var_1_6 & 10000 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_9=10] [L60] signed long int stepLocal_0 = var_1_6 & 10000; [L61] EXPR (last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_0=10000, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_9=10] [L61] COND TRUE ((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < stepLocal_0 [L62] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L66] COND TRUE last_1_var_1_14 <= last_1_var_1_15 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L67] COND TRUE ((last_1_var_1_26 % var_1_6) * (last_1_var_1_17 / 1000000000u)) >= ((((10u) < (var_1_13)) ? (10u) : (var_1_13))) [L68] var_1_14 = var_1_13 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L75] COND FALSE !(last_1_var_1_20 > last_1_var_1_15) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L80] COND TRUE last_1_var_1_14 <= 16 [L81] var_1_9 = last_1_var_1_25 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L84] unsigned long int stepLocal_5 = (3423867512u - var_1_13) - var_1_24; [L85] signed long int stepLocal_4 = 8; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_4=8, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L86] EXPR last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_4=8, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L86] COND TRUE stepLocal_4 > (last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25)))) [L87] COND FALSE !(var_1_8 >= last_1_var_1_18) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L95] EXPR last_1_var_1_11 >> var_1_14 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L95] COND FALSE !(! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) [L98] signed char stepLocal_1 = var_1_13; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_1=0, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L99] COND TRUE (var_1_9 + var_1_25) >= stepLocal_1 [L100] var_1_18 = ((((var_1_7) > (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19))))) ? (var_1_7) : (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19)))))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L102] var_1_17 = var_1_13 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L103] COND TRUE ! var_1_2 [L104] var_1_22 = (var_1_23 - var_1_25) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L108] COND TRUE var_1_7 >= 4.5 [L109] var_1_15 = (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) - ((((var_1_13) > (var_1_25)) ? (var_1_13) : (var_1_25)))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L111] var_1_28 = (var_1_29 - (var_1_13 + ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) [L112] unsigned long int stepLocal_3 = var_1_22; [L113] signed char stepLocal_2 = var_1_13; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_2=0, stepLocal_3=-2147483651, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L114] COND TRUE stepLocal_2 == (var_1_6 * (var_1_12 - 64)) [L115] var_1_20 = var_1_17 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_3=-2147483651, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L125] unsigned long int stepLocal_7 = var_1_14; [L126] unsigned long int stepLocal_6 = var_1_23; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_3=-2147483651, stepLocal_5=2350125689, stepLocal_6=-2147483649, stepLocal_7=0, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L127] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_3=-2147483651, stepLocal_5=2350125689, stepLocal_6=-2147483649, stepLocal_7=0, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L198] RET step() [L199] CALL, EXPR property() [L189] EXPR (last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189] EXPR var_1_6 & 10000 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189] EXPR (((((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < (var_1_6 & 10000)) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))))) && ((last_1_var_1_20 > last_1_var_1_15) ? ((last_1_var_1_1 < var_1_7) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1) : ((last_1_var_1_14 <= 16) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1))) && ((! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) ? (var_1_11 == ((unsigned short int) var_1_13)) : 1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189] EXPR ((((((((((((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < (var_1_6 & 10000)) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))))) && ((last_1_var_1_20 > last_1_var_1_15) ? ((last_1_var_1_1 < var_1_7) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1) : ((last_1_var_1_14 <= 16) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1))) && ((! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) ? (var_1_11 == ((unsigned short int) var_1_13)) : 1)) && ((last_1_var_1_14 <= last_1_var_1_15) ? ((((last_1_var_1_26 % var_1_6) * (last_1_var_1_17 / 1000000000u)) >= ((((10u) < (var_1_13)) ? (10u) : (var_1_13)))) ? (var_1_14 == ((unsigned long int) var_1_13)) : (var_1_14 == ((unsigned long int) last_1_var_1_22))) : (var_1_14 == ((unsigned long int) last_1_var_1_26)))) && ((var_1_7 >= 4.5) ? (var_1_15 == ((signed short int) (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) - ((((var_1_13) > (var_1_25)) ? (var_1_13) : (var_1_25)))))) : 1)) && (var_1_17 == ((unsigned char) var_1_13))) && (((var_1_9 + var_1_25) >= var_1_13) ? (var_1_18 == ((double) ((((var_1_7) > (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19))))) ? (var_1_7) : (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19)))))))) : 1)) && ((var_1_13 == (var_1_6 * (var_1_12 - 64))) ? (var_1_20 == ((unsigned long int) var_1_17)) : ((! (var_1_7 <= (var_1_1 * var_1_8))) ? ((var_1_28 < var_1_22) ? (var_1_20 == ((unsigned long int) var_1_9)) : (var_1_20 == ((unsigned long int) var_1_9))) : 1))) && ((! var_1_2) ? (var_1_22 == ((unsigned long int) (var_1_23 - var_1_25))) : (var_1_22 == ((unsigned long int) (var_1_17 + (var_1_24 - var_1_9)))))) && ((8 > (last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25))))) ? ((var_1_8 >= last_1_var_1_18) ? ((((last_1_var_1_28 | last_1_var_1_25) + last_1_var_1_11) < ((3423867512u - var_1_13) - var_1_24)) ? (var_1_25 == ((unsigned char) var_1_13)) : 1) : 1) : (var_1_25 == ((unsigned char) var_1_13))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189-L190] return ((((((((((((((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < (var_1_6 & 10000)) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))))) && ((last_1_var_1_20 > last_1_var_1_15) ? ((last_1_var_1_1 < var_1_7) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1) : ((last_1_var_1_14 <= 16) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1))) && ((! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) ? (var_1_11 == ((unsigned short int) var_1_13)) : 1)) && ((last_1_var_1_14 <= last_1_var_1_15) ? ((((last_1_var_1_26 % var_1_6) * (last_1_var_1_17 / 1000000000u)) >= ((((10u) < (var_1_13)) ? (10u) : (var_1_13)))) ? (var_1_14 == ((unsigned long int) var_1_13)) : (var_1_14 == ((unsigned long int) last_1_var_1_22))) : (var_1_14 == ((unsigned long int) last_1_var_1_26)))) && ((var_1_7 >= 4.5) ? (var_1_15 == ((signed short int) (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) - ((((var_1_13) > (var_1_25)) ? (var_1_13) : (var_1_25)))))) : 1)) && (var_1_17 == ((unsigned char) var_1_13))) && (((var_1_9 + var_1_25) >= var_1_13) ? (var_1_18 == ((double) ((((var_1_7) > (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19))))) ? (var_1_7) : (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19)))))))) : 1)) && ((var_1_13 == (var_1_6 * (var_1_12 - 64))) ? (var_1_20 == ((unsigned long int) var_1_17)) : ((! (var_1_7 <= (var_1_1 * var_1_8))) ? ((var_1_28 < var_1_22) ? (var_1_20 == ((unsigned long int) var_1_9)) : (var_1_20 == ((unsigned long int) var_1_9))) : 1))) && ((! var_1_2) ? (var_1_22 == ((unsigned long int) (var_1_23 - var_1_25))) : (var_1_22 == ((unsigned long int) (var_1_17 + (var_1_24 - var_1_9)))))) && ((8 > (last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25))))) ? ((var_1_8 >= last_1_var_1_18) ? ((((last_1_var_1_28 | last_1_var_1_25) + last_1_var_1_11) < ((3423867512u - var_1_13) - var_1_24)) ? (var_1_25 == ((unsigned char) var_1_13)) : 1) : 1) : (var_1_25 == ((unsigned char) var_1_13)))) && (var_1_2 ? ((var_1_23 >= var_1_25) ? (((var_1_25 - 10) <= var_1_14) ? (var_1_27 ? (var_1_26 == ((signed long int) (((((((((var_1_25) < (var_1_22)) ? (var_1_25) : (var_1_22)))) < (var_1_17)) ? (((((var_1_25) < (var_1_22)) ? (var_1_25) : (var_1_22)))) : (var_1_17))) + var_1_17))) : 1) : (var_1_26 == ((signed long int) ((((var_1_12) < (var_1_17)) ? (var_1_12) : (var_1_17)))))) : (var_1_26 == ((signed long int) ((-32 + var_1_22) + var_1_14)))) : 1)) && (var_1_28 == ((unsigned short int) (var_1_29 - (var_1_13 + ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))))) ; [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2261 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2259 mSDsluCounter, 5749 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3616 mSDsCounter, 539 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 885 IncrementalHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 539 mSolverCounterUnsat, 2133 mSDtfsCounter, 885 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 851 GetRequests, 805 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2449occurred in iteration=10, InterpolantAutomatonStates: 54, 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, 11 MinimizatonAttempts, 863 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 2134 NumberOfCodeBlocks, 2134 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1961 ConstructedInterpolants, 0 QuantifiedInterpolants, 5747 SizeOfPredicates, 0 NumberOfNonLiveVariables, 413 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 9745/9880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 00:21:18,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_operatoramount_amount100_file-11.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 8b670c0ce186fd09c40b80582419dd7d06ef4a420fd0c29de5d521d6799e6a1a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:21:21,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:21:21,113 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:21:21,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:21:21,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:21:21,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:21:21,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:21:21,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:21:21,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:21:21,158 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:21:21,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:21:21,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:21:21,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:21:21,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:21:21,162 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:21:21,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:21:21,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:21:21,163 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:21:21,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:21:21,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:21:21,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:21:21,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:21:21,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:21:21,171 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:21:21,172 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:21:21,172 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:21:21,172 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:21:21,173 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:21:21,173 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:21:21,173 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:21:21,174 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:21:21,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:21:21,175 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:21:21,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:21:21,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:21:21,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:21:21,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:21:21,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:21:21,177 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:21:21,177 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:21:21,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:21:21,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:21:21,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:21:21,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:21:21,179 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 -> 8b670c0ce186fd09c40b80582419dd7d06ef4a420fd0c29de5d521d6799e6a1a [2024-11-09 00:21:21,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:21:21,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:21:21,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:21:21,569 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:21:21,570 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:21:21,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-11.i [2024-11-09 00:21:23,239 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:21:23,513 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:21:23,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-11.i [2024-11-09 00:21:23,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c2899b0/4ccbbae4e4f44be889f8da265fd4ee46/FLAGc097026ab [2024-11-09 00:21:23,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c2899b0/4ccbbae4e4f44be889f8da265fd4ee46 [2024-11-09 00:21:23,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:21:23,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:21:23,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:21:23,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:21:23,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:21:23,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:21:23" (1/1) ... [2024-11-09 00:21:23,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6897c376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:23, skipping insertion in model container [2024-11-09 00:21:23,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:21:23" (1/1) ... [2024-11-09 00:21:23,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:21:24,065 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_operatoramount_amount100_file-11.i[916,929] [2024-11-09 00:21:24,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:21:24,187 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:21:24,200 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_operatoramount_amount100_file-11.i[916,929] [2024-11-09 00:21:24,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:21:24,287 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:21:24,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24 WrapperNode [2024-11-09 00:21:24,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:21:24,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:21:24,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:21:24,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:21:24,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:24,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:24,375 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-11-09 00:21:24,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:21:24,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:21:24,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:21:24,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:21:24,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:24,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:24,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:24,420 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:21:24,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:24,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:24,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:24,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:24,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:24,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:24,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:21:24,469 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:21:24,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:21:24,469 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:21:24,470 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (1/1) ... [2024-11-09 00:21:24,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:21:24,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:21:24,507 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:21:24,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:21:24,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:21:24,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:21:24,557 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:21:24,558 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:21:24,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:21:24,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:21:24,676 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:21:24,681 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:21:30,540 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-09 00:21:30,540 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:21:30,555 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:21:30,556 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:21:30,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:21:30 BoogieIcfgContainer [2024-11-09 00:21:30,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:21:30,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:21:30,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:21:30,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:21:30,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:21:23" (1/3) ... [2024-11-09 00:21:30,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5859fe3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:21:30, skipping insertion in model container [2024-11-09 00:21:30,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:24" (2/3) ... [2024-11-09 00:21:30,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5859fe3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:21:30, skipping insertion in model container [2024-11-09 00:21:30,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:21:30" (3/3) ... [2024-11-09 00:21:30,566 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-11.i [2024-11-09 00:21:30,583 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:21:30,583 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:21:30,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:21:30,660 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;@f738283, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:21:30,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:21:30,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:21:30,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 00:21:30,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:30,684 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:21:30,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:30,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:30,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1600914285, now seen corresponding path program 1 times [2024-11-09 00:21:30,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:21:30,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697508374] [2024-11-09 00:21:30,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:30,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:21:30,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:21:30,713 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:21:30,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 00:21:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:31,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:21:31,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:21:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-09 00:21:31,225 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:21:31,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:21:31,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697508374] [2024-11-09 00:21:31,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697508374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:21:31,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:21:31,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:21:31,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448915150] [2024-11-09 00:21:31,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:21:31,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:21:31,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:21:31,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:21:31,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:21:31,267 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:21:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:31,302 INFO L93 Difference]: Finished difference Result 143 states and 248 transitions. [2024-11-09 00:21:31,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:21:31,304 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 136 [2024-11-09 00:21:31,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:31,311 INFO L225 Difference]: With dead ends: 143 [2024-11-09 00:21:31,312 INFO L226 Difference]: Without dead ends: 71 [2024-11-09 00:21:31,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:21:31,318 INFO L432 NwaCegarLoop]: 110 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, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:31,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:21:31,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-09 00:21:31,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-09 00:21:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:21:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 110 transitions. [2024-11-09 00:21:31,376 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 110 transitions. Word has length 136 [2024-11-09 00:21:31,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:31,377 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 110 transitions. [2024-11-09 00:21:31,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:21:31,378 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 110 transitions. [2024-11-09 00:21:31,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 00:21:31,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:31,383 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:21:31,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:21:31,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:21:31,585 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:31,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:31,586 INFO L85 PathProgramCache]: Analyzing trace with hash 97337611, now seen corresponding path program 1 times [2024-11-09 00:21:31,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:21:31,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243447432] [2024-11-09 00:21:31,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:31,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:21:31,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:21:31,590 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:21:31,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 00:21:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:32,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 00:21:32,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:21:34,732 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:21:34,732 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:21:34,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:21:34,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243447432] [2024-11-09 00:21:34,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243447432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:21:34,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:21:34,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:21:34,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045233433] [2024-11-09 00:21:34,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:21:34,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:21:34,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:21:34,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:21:34,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:21:34,736 INFO L87 Difference]: Start difference. First operand 71 states and 110 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:37,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:21:40,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:21:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:40,410 INFO L93 Difference]: Finished difference Result 208 states and 325 transitions. [2024-11-09 00:21:40,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:21:40,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-11-09 00:21:40,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:40,452 INFO L225 Difference]: With dead ends: 208 [2024-11-09 00:21:40,452 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 00:21:40,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:21:40,454 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 69 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:40,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 292 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-09 00:21:40,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 00:21:40,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 113. [2024-11-09 00:21:40,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 00:21:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 174 transitions. [2024-11-09 00:21:40,495 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 174 transitions. Word has length 136 [2024-11-09 00:21:40,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:40,495 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 174 transitions. [2024-11-09 00:21:40,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:40,496 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 174 transitions. [2024-11-09 00:21:40,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 00:21:40,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:40,498 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:21:40,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 00:21:40,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:21:40,702 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:40,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:40,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1118152020, now seen corresponding path program 1 times [2024-11-09 00:21:40,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:21:40,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742758162] [2024-11-09 00:21:40,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:40,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:21:40,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:21:40,708 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:21:40,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 00:21:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:41,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 00:21:41,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:21:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:21:43,505 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:21:43,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:21:43,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742758162] [2024-11-09 00:21:43,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742758162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:21:43,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:21:43,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:21:43,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225598488] [2024-11-09 00:21:43,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:21:43,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:21:43,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:21:43,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:21:43,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:21:43,510 INFO L87 Difference]: Start difference. First operand 113 states and 174 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:47,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:21:51,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:21:51,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:51,130 INFO L93 Difference]: Finished difference Result 264 states and 409 transitions. [2024-11-09 00:21:51,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:21:51,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-09 00:21:51,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:51,136 INFO L225 Difference]: With dead ends: 264 [2024-11-09 00:21:51,136 INFO L226 Difference]: Without dead ends: 196 [2024-11-09 00:21:51,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:21:51,138 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 107 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:51,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 324 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-11-09 00:21:51,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-09 00:21:51,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 177. [2024-11-09 00:21:51,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 00:21:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 274 transitions. [2024-11-09 00:21:51,186 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 274 transitions. Word has length 137 [2024-11-09 00:21:51,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:51,186 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 274 transitions. [2024-11-09 00:21:51,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:51,187 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 274 transitions. [2024-11-09 00:21:51,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 00:21:51,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:51,189 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:21:51,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 00:21:51,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:21:51,391 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:51,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:51,392 INFO L85 PathProgramCache]: Analyzing trace with hash -326916524, now seen corresponding path program 1 times [2024-11-09 00:21:51,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:21:51,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368419379] [2024-11-09 00:21:51,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:51,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:21:51,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:21:51,398 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:21:51,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 00:21:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:51,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 00:21:51,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:21:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:21:52,643 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:21:52,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:21:52,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368419379] [2024-11-09 00:21:52,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368419379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:21:52,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:21:52,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:21:52,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960293781] [2024-11-09 00:21:52,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:21:52,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:21:52,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:21:52,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:21:52,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:21:52,646 INFO L87 Difference]: Start difference. First operand 177 states and 274 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:54,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:21:56,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:21:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:56,497 INFO L93 Difference]: Finished difference Result 348 states and 542 transitions. [2024-11-09 00:21:56,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:21:56,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-09 00:21:56,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:56,542 INFO L225 Difference]: With dead ends: 348 [2024-11-09 00:21:56,542 INFO L226 Difference]: Without dead ends: 216 [2024-11-09 00:21:56,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:21:56,545 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 75 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:56,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 366 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 00:21:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-09 00:21:56,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 179. [2024-11-09 00:21:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 115 states have (on average 1.3565217391304347) internal successors, (156), 115 states have internal predecessors, (156), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 00:21:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 276 transitions. [2024-11-09 00:21:56,585 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 276 transitions. Word has length 137 [2024-11-09 00:21:56,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:56,586 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 276 transitions. [2024-11-09 00:21:56,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:21:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 276 transitions. [2024-11-09 00:21:56,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 00:21:56,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:56,593 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:21:56,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 00:21:56,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:21:56,794 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:56,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:56,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1469543727, now seen corresponding path program 1 times [2024-11-09 00:21:56,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:21:56,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884470920] [2024-11-09 00:21:56,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:56,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:21:56,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:21:56,797 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:21:56,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 00:21:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:57,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 00:21:57,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:21:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 397 proven. 30 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2024-11-09 00:21:59,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:21:59,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:21:59,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884470920] [2024-11-09 00:21:59,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884470920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:21:59,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1975507210] [2024-11-09 00:21:59,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:59,851 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 00:21:59,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 00:21:59,853 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 00:21:59,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-09 00:22:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:00,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 00:22:00,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:22:04,736 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:22:04,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:22:04,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1975507210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:22:04,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 00:22:04,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-11-09 00:22:04,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433305526] [2024-11-09 00:22:04,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:22:04,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:22:04,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:22:04,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:22:04,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:22:04,739 INFO L87 Difference]: Start difference. First operand 179 states and 276 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:22:12,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 00:22:13,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 00:22:18,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 00:22:20,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 00:22:24,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]