./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.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 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:18:58,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:18:58,229 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:18:58,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:18:58,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:18:58,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:18:58,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:18:58,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:18:58,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:18:58,265 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:18:58,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:18:58,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:18:58,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:18:58,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:18:58,267 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:18:58,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:18:58,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:18:58,269 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:18:58,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:18:58,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:18:58,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:18:58,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:18:58,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:18:58,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:18:58,274 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:18:58,274 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:18:58,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:18:58,275 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:18:58,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:18:58,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:18:58,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:18:58,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:18:58,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:18:58,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:18:58,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:18:58,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:18:58,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:18:58,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:18:58,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:18:58,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:18:58,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:18:58,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:18:58,281 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 -> 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 [2024-11-08 20:18:58,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:18:58,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:18:58,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:18:58,551 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:18:58,551 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:18:58,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-11-08 20:19:00,031 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:19:00,220 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:19:00,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-11-08 20:19:00,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aada6cec6/4181da9ef9ad4d319050bbd0ab16c669/FLAGda5535f82 [2024-11-08 20:19:00,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aada6cec6/4181da9ef9ad4d319050bbd0ab16c669 [2024-11-08 20:19:00,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:19:00,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:19:00,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:19:00,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:19:00,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:19:00,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:19:00" (1/1) ... [2024-11-08 20:19:00,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ce255d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:00, skipping insertion in model container [2024-11-08 20:19:00,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:19:00" (1/1) ... [2024-11-08 20:19:00,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:19:00,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i[914,927] [2024-11-08 20:19:00,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:19:00,575 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:19:00,586 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i[914,927] [2024-11-08 20:19:00,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:19:00,634 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:19:00,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:00 WrapperNode [2024-11-08 20:19:00,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:19:00,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:19:00,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:19:00,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:19:00,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:00" (1/1) ... [2024-11-08 20:19:00,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:00" (1/1) ... [2024-11-08 20:19:00,682 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2024-11-08 20:19:00,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:19:00,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:19:00,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:19:00,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:19:00,698 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:00" (1/1) ... [2024-11-08 20:19:00,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:00" (1/1) ... [2024-11-08 20:19:00,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:00" (1/1) ... [2024-11-08 20:19:00,727 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:19:00,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:00" (1/1) ... [2024-11-08 20:19:00,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:00" (1/1) ... [2024-11-08 20:19:00,744 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:00" (1/1) ... [2024-11-08 20:19:00,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:00" (1/1) ... [2024-11-08 20:19:00,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:00" (1/1) ... [2024-11-08 20:19:00,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:00" (1/1) ... [2024-11-08 20:19:00,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:19:00,755 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:19:00,755 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:19:00,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:19:00,756 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:00" (1/1) ... [2024-11-08 20:19:00,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:19:00,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:19:00,792 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:19:00,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:19:00,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:19:00,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:19:00,846 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:19:00,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:19:00,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:19:00,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:19:00,939 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:19:00,944 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:19:01,373 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 20:19:01,373 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:19:01,390 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:19:01,390 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:19:01,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:19:01 BoogieIcfgContainer [2024-11-08 20:19:01,391 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:19:01,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:19:01,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:19:01,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:19:01,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:19:00" (1/3) ... [2024-11-08 20:19:01,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5fd687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:19:01, skipping insertion in model container [2024-11-08 20:19:01,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:00" (2/3) ... [2024-11-08 20:19:01,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5fd687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:19:01, skipping insertion in model container [2024-11-08 20:19:01,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:19:01" (3/3) ... [2024-11-08 20:19:01,400 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-11-08 20:19:01,415 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:19:01,416 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:19:01,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:19:01,477 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;@32b3b99a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:19:01,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:19:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 20:19:01,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 20:19:01,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:01,501 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:19:01,502 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:01,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:01,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1783273033, now seen corresponding path program 1 times [2024-11-08 20:19:01,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:19:01,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816569139] [2024-11-08 20:19:01,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:19:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:01,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:19:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:01,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:19:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:01,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:19:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:01,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:19:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:01,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:19:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:01,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:19:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:01,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:19:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:01,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:19:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:01,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:19:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:01,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:19:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:01,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:19:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:01,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:19:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:01,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:19:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:01,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:19:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:01,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:19:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:01,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:19:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:01,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:19:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:01,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:19:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:01,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:19:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:02,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:19:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:02,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:19:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:02,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:19:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:02,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:19:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:02,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:19:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:02,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:19:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:02,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:19:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:02,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:19:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:02,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:19:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:02,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:19:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:02,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:19:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 20:19:02,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:19:02,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816569139] [2024-11-08 20:19:02,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816569139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:19:02,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:19:02,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:19:02,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487174746] [2024-11-08 20:19:02,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:19:02,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:19:02,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:19:02,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:19:02,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:19:02,103 INFO L87 Difference]: Start difference. First operand has 81 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 20:19:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:19:02,138 INFO L93 Difference]: Finished difference Result 155 states and 274 transitions. [2024-11-08 20:19:02,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:19:02,141 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 186 [2024-11-08 20:19:02,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:19:02,150 INFO L225 Difference]: With dead ends: 155 [2024-11-08 20:19:02,151 INFO L226 Difference]: Without dead ends: 77 [2024-11-08 20:19:02,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:19:02,160 INFO L432 NwaCegarLoop]: 117 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, 117 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:19:02,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:19:02,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-08 20:19:02,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-08 20:19:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 20:19:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2024-11-08 20:19:02,235 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 186 [2024-11-08 20:19:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:19:02,236 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2024-11-08 20:19:02,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 20:19:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2024-11-08 20:19:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 20:19:02,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:02,242 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:19:02,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:19:02,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:02,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:02,244 INFO L85 PathProgramCache]: Analyzing trace with hash -579856256, now seen corresponding path program 1 times [2024-11-08 20:19:02,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:19:02,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041645868] [2024-11-08 20:19:02,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:02,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:19:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:19:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:19:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:19:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:19:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:19:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:19:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:19:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:19:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:19:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:19:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:19:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:19:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:19:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:19:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:19:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:19:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:19:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:19:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:19:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:19:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:19:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:19:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:19:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:19:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:19:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:19:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:19:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:19:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:19:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:19:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 20:19:03,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:19:03,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041645868] [2024-11-08 20:19:03,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041645868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:19:03,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:19:03,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:19:03,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497472717] [2024-11-08 20:19:03,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:19:03,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:19:03,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:19:03,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:19:03,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:19:03,516 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 20:19:03,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:19:03,643 INFO L93 Difference]: Finished difference Result 179 states and 266 transitions. [2024-11-08 20:19:03,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:19:03,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 187 [2024-11-08 20:19:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:19:03,646 INFO L225 Difference]: With dead ends: 179 [2024-11-08 20:19:03,646 INFO L226 Difference]: Without dead ends: 105 [2024-11-08 20:19:03,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:19:03,648 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 38 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:19:03,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 305 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:19:03,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-08 20:19:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2024-11-08 20:19:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 20:19:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 132 transitions. [2024-11-08 20:19:03,662 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 132 transitions. Word has length 187 [2024-11-08 20:19:03,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:19:03,664 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 132 transitions. [2024-11-08 20:19:03,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 20:19:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 132 transitions. [2024-11-08 20:19:03,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 20:19:03,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:03,668 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:19:03,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:19:03,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:03,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:03,670 INFO L85 PathProgramCache]: Analyzing trace with hash -578009214, now seen corresponding path program 1 times [2024-11-08 20:19:03,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:19:03,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754419296] [2024-11-08 20:19:03,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:03,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:19:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:19:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:19:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:19:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:19:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:19:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:19:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:19:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:19:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:19:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:19:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:19:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:19:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:19:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:19:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:19:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:19:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:19:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:19:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:19:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:19:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:19:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:19:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:19:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:19:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:19:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:19:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:19:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:19:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:19:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:19:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 20:19:09,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:19:09,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754419296] [2024-11-08 20:19:09,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754419296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:19:09,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:19:09,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 20:19:09,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106469111] [2024-11-08 20:19:09,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:19:09,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 20:19:09,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:19:09,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 20:19:09,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 20:19:09,424 INFO L87 Difference]: Start difference. First operand 87 states and 132 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 20:19:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:19:10,111 INFO L93 Difference]: Finished difference Result 245 states and 359 transitions. [2024-11-08 20:19:10,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 20:19:10,115 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 187 [2024-11-08 20:19:10,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:19:10,119 INFO L225 Difference]: With dead ends: 245 [2024-11-08 20:19:10,119 INFO L226 Difference]: Without dead ends: 161 [2024-11-08 20:19:10,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-08 20:19:10,121 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 99 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 20:19:10,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 585 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 20:19:10,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-08 20:19:10,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 126. [2024-11-08 20:19:10,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 92 states have internal predecessors, (118), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 20:19:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2024-11-08 20:19:10,140 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 182 transitions. Word has length 187 [2024-11-08 20:19:10,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:19:10,141 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 182 transitions. [2024-11-08 20:19:10,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 20:19:10,141 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 182 transitions. [2024-11-08 20:19:10,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 20:19:10,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:10,145 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:19:10,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:19:10,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:10,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:10,149 INFO L85 PathProgramCache]: Analyzing trace with hash -319843776, now seen corresponding path program 1 times [2024-11-08 20:19:10,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:19:10,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983812531] [2024-11-08 20:19:10,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:10,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:19:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:19:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:19:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:19:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:19:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:19:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:19:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:19:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:19:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:19:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:19:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:19:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:19:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:19:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:19:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:19:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:19:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:19:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:19:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:19:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:19:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:19:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:19:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:19:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:19:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:19:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:19:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:19:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:19:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:19:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:19:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 20:19:10,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:19:10,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983812531] [2024-11-08 20:19:10,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983812531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:19:10,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:19:10,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:19:10,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867286300] [2024-11-08 20:19:10,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:19:10,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:19:10,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:19:10,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:19:10,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:19:10,645 INFO L87 Difference]: Start difference. First operand 126 states and 182 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 20:19:10,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:19:10,713 INFO L93 Difference]: Finished difference Result 346 states and 506 transitions. [2024-11-08 20:19:10,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:19:10,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 187 [2024-11-08 20:19:10,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:19:10,718 INFO L225 Difference]: With dead ends: 346 [2024-11-08 20:19:10,718 INFO L226 Difference]: Without dead ends: 223 [2024-11-08 20:19:10,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:19:10,720 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 58 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:19:10,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 230 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:19:10,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-08 20:19:10,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2024-11-08 20:19:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 152 states have (on average 1.2894736842105263) internal successors, (196), 154 states have internal predecessors, (196), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 20:19:10,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 324 transitions. [2024-11-08 20:19:10,763 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 324 transitions. Word has length 187 [2024-11-08 20:19:10,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:19:10,766 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 324 transitions. [2024-11-08 20:19:10,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 20:19:10,766 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 324 transitions. [2024-11-08 20:19:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 20:19:10,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:10,769 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:19:10,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 20:19:10,770 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:10,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:10,771 INFO L85 PathProgramCache]: Analyzing trace with hash 407642383, now seen corresponding path program 1 times [2024-11-08 20:19:10,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:19:10,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265275197] [2024-11-08 20:19:10,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:10,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:19:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:19:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:19:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:19:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:19:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:19:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:19:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:19:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:19:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:19:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:19:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:10,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:19:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:19:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:19:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:19:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:19:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:19:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:19:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:19:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:19:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:19:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:19:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:19:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:19:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:19:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:19:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:19:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:19:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:19:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:19:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:19:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 20:19:11,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:19:11,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265275197] [2024-11-08 20:19:11,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265275197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:19:11,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:19:11,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:19:11,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718670423] [2024-11-08 20:19:11,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:19:11,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:19:11,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:19:11,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:19:11,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:19:11,038 INFO L87 Difference]: Start difference. First operand 221 states and 324 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 20:19:11,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:19:11,254 INFO L93 Difference]: Finished difference Result 436 states and 637 transitions. [2024-11-08 20:19:11,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:19:11,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 188 [2024-11-08 20:19:11,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:19:11,259 INFO L225 Difference]: With dead ends: 436 [2024-11-08 20:19:11,261 INFO L226 Difference]: Without dead ends: 313 [2024-11-08 20:19:11,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:19:11,263 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 123 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:19:11,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 434 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:19:11,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-08 20:19:11,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 306. [2024-11-08 20:19:11,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 203 states have (on average 1.2561576354679802) internal successors, (255), 206 states have internal predecessors, (255), 96 states have call successors, (96), 6 states have call predecessors, (96), 6 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-08 20:19:11,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 447 transitions. [2024-11-08 20:19:11,320 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 447 transitions. Word has length 188 [2024-11-08 20:19:11,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:19:11,321 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 447 transitions. [2024-11-08 20:19:11,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 20:19:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 447 transitions. [2024-11-08 20:19:11,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 20:19:11,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:11,325 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:19:11,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 20:19:11,325 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:11,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:11,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1087700753, now seen corresponding path program 1 times [2024-11-08 20:19:11,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:19:11,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443526012] [2024-11-08 20:19:11,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:11,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:19:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:19:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:19:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:19:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:19:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:19:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:19:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:19:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:19:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:19:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:19:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:19:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:19:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:19:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:19:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:19:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:19:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:19:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:19:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:19:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:19:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:19:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:19:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:19:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:19:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:19:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:19:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:19:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:19:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:19:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:19:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 24 proven. 63 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 20:19:12,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:19:12,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443526012] [2024-11-08 20:19:12,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443526012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:19:12,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599808721] [2024-11-08 20:19:12,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:12,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:19:12,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:19:12,232 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:19:12,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 20:19:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:12,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-08 20:19:12,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:19:15,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 801 proven. 276 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2024-11-08 20:19:15,986 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:19:27,120 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 20:19:41,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599808721] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:19:41,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 20:19:41,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19] total 26 [2024-11-08 20:19:41,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388844690] [2024-11-08 20:19:41,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 20:19:41,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 20:19:41,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:19:41,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 20:19:41,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=1159, Unknown=1, NotChecked=0, Total=1560 [2024-11-08 20:19:41,484 INFO L87 Difference]: Start difference. First operand 306 states and 447 transitions. Second operand has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 24 states have internal predecessors, (95), 8 states have call successors, (60), 7 states have call predecessors, (60), 10 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2024-11-08 20:19:45,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:19:45,979 INFO L93 Difference]: Finished difference Result 1093 states and 1527 transitions. [2024-11-08 20:19:45,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-11-08 20:19:45,980 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 24 states have internal predecessors, (95), 8 states have call successors, (60), 7 states have call predecessors, (60), 10 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) Word has length 188 [2024-11-08 20:19:45,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:19:45,988 INFO L225 Difference]: With dead ends: 1093 [2024-11-08 20:19:45,990 INFO L226 Difference]: Without dead ends: 885 [2024-11-08 20:19:45,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4708 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=3166, Invalid=11595, Unknown=1, NotChecked=0, Total=14762 [2024-11-08 20:19:45,995 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 789 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 20:19:45,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 909 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 20:19:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-11-08 20:19:46,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 782. [2024-11-08 20:19:46,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 511 states have (on average 1.213307240704501) internal successors, (620), 521 states have internal predecessors, (620), 236 states have call successors, (236), 34 states have call predecessors, (236), 34 states have return successors, (236), 226 states have call predecessors, (236), 236 states have call successors, (236) [2024-11-08 20:19:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1092 transitions. [2024-11-08 20:19:46,123 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1092 transitions. Word has length 188 [2024-11-08 20:19:46,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:19:46,124 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1092 transitions. [2024-11-08 20:19:46,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 24 states have internal predecessors, (95), 8 states have call successors, (60), 7 states have call predecessors, (60), 10 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2024-11-08 20:19:46,124 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1092 transitions. [2024-11-08 20:19:46,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 20:19:46,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:46,126 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:19:46,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 20:19:46,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 20:19:46,327 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:46,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:46,328 INFO L85 PathProgramCache]: Analyzing trace with hash 498643504, now seen corresponding path program 1 times [2024-11-08 20:19:46,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:19:46,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906425242] [2024-11-08 20:19:46,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:46,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:19:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:19:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:19:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:19:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:19:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:19:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:19:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:19:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:19:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:19:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:19:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:19:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:19:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:19:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:19:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:19:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:19:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:19:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:19:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:19:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:19:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:19:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:19:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:19:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:19:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:19:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:19:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:19:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:19:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:19:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:19:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 3 proven. 84 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 20:19:46,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:19:46,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906425242] [2024-11-08 20:19:46,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906425242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:19:46,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250586149] [2024-11-08 20:19:46,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:46,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:19:46,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:19:46,794 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:19:46,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 20:19:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:46,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 20:19:46,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:19:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 143 proven. 84 refuted. 0 times theorem prover too weak. 1513 trivial. 0 not checked. [2024-11-08 20:19:47,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:19:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 3 proven. 84 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 20:19:47,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250586149] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 20:19:47,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 20:19:47,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-08 20:19:47,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103053329] [2024-11-08 20:19:47,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 20:19:47,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 20:19:47,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:19:47,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 20:19:47,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 20:19:47,685 INFO L87 Difference]: Start difference. First operand 782 states and 1092 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2024-11-08 20:19:48,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:19:48,392 INFO L93 Difference]: Finished difference Result 2311 states and 3154 transitions. [2024-11-08 20:19:48,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 20:19:48,393 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 188 [2024-11-08 20:19:48,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:19:48,406 INFO L225 Difference]: With dead ends: 2311 [2024-11-08 20:19:48,406 INFO L226 Difference]: Without dead ends: 1607 [2024-11-08 20:19:48,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 428 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-11-08 20:19:48,411 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 160 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 20:19:48,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 595 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 20:19:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2024-11-08 20:19:48,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1203. [2024-11-08 20:19:48,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 762 states have (on average 1.1968503937007875) internal successors, (912), 766 states have internal predecessors, (912), 384 states have call successors, (384), 56 states have call predecessors, (384), 56 states have return successors, (384), 380 states have call predecessors, (384), 384 states have call successors, (384) [2024-11-08 20:19:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1680 transitions. [2024-11-08 20:19:48,607 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1680 transitions. Word has length 188 [2024-11-08 20:19:48,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:19:48,608 INFO L471 AbstractCegarLoop]: Abstraction has 1203 states and 1680 transitions. [2024-11-08 20:19:48,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2024-11-08 20:19:48,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1680 transitions. [2024-11-08 20:19:48,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 20:19:48,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:48,611 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:19:48,631 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-08 20:19:48,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-08 20:19:48,816 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:48,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:48,816 INFO L85 PathProgramCache]: Analyzing trace with hash 500490546, now seen corresponding path program 1 times [2024-11-08 20:19:48,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:19:48,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892766645] [2024-11-08 20:19:48,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:48,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:19:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:19:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:19:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:19:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:19:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:19:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:19:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:19:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:19:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:19:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:19:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:19:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:19:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:19:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:19:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:19:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:19:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:19:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:19:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:19:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:19:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:19:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:19:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:19:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:19:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:19:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:19:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:19:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:19:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:19:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:48,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:19:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 20:19:49,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:19:49,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892766645] [2024-11-08 20:19:49,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892766645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:19:49,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:19:49,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:19:49,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555166924] [2024-11-08 20:19:49,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:19:49,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:19:49,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:19:49,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:19:49,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:19:49,011 INFO L87 Difference]: Start difference. First operand 1203 states and 1680 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 20:19:49,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:19:49,109 INFO L93 Difference]: Finished difference Result 2121 states and 2986 transitions. [2024-11-08 20:19:49,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:19:49,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 188 [2024-11-08 20:19:49,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:19:49,117 INFO L225 Difference]: With dead ends: 2121 [2024-11-08 20:19:49,117 INFO L226 Difference]: Without dead ends: 879 [2024-11-08 20:19:49,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:19:49,121 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 108 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:19:49,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 227 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:19:49,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2024-11-08 20:19:49,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 877. [2024-11-08 20:19:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 560 states have (on average 1.2017857142857142) internal successors, (673), 562 states have internal predecessors, (673), 282 states have call successors, (282), 34 states have call predecessors, (282), 34 states have return successors, (282), 280 states have call predecessors, (282), 282 states have call successors, (282) [2024-11-08 20:19:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1237 transitions. [2024-11-08 20:19:49,213 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1237 transitions. Word has length 188 [2024-11-08 20:19:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:19:49,214 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1237 transitions. [2024-11-08 20:19:49,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 20:19:49,214 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1237 transitions. [2024-11-08 20:19:49,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 20:19:49,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:49,217 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:19:49,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 20:19:49,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:49,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:49,217 INFO L85 PathProgramCache]: Analyzing trace with hash 279811545, now seen corresponding path program 1 times [2024-11-08 20:19:49,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:19:49,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409205879] [2024-11-08 20:19:49,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:49,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:19:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:19:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:19:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:19:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:19:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:19:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:19:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:19:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:19:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:19:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:19:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:19:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:19:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:19:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:19:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:19:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:19:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:19:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:19:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:19:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:19:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:19:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:19:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:19:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:19:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:19:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:19:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:19:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:19:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:19:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:19:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 9 proven. 78 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 20:19:49,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:19:49,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409205879] [2024-11-08 20:19:49,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409205879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:19:49,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714924489] [2024-11-08 20:19:49,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:49,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:19:49,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:19:49,541 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:19:49,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 20:19:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:49,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 20:19:49,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:19:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 347 proven. 78 refuted. 0 times theorem prover too weak. 1315 trivial. 0 not checked. [2024-11-08 20:19:49,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:19:50,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 9 proven. 78 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 20:19:50,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714924489] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 20:19:50,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 20:19:50,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 20:19:50,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377401904] [2024-11-08 20:19:50,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 20:19:50,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 20:19:50,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:19:50,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 20:19:50,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:19:50,222 INFO L87 Difference]: Start difference. First operand 877 states and 1237 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2024-11-08 20:19:50,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:19:50,462 INFO L93 Difference]: Finished difference Result 1140 states and 1560 transitions. [2024-11-08 20:19:50,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 20:19:50,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) Word has length 188 [2024-11-08 20:19:50,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:19:50,466 INFO L225 Difference]: With dead ends: 1140 [2024-11-08 20:19:50,466 INFO L226 Difference]: Without dead ends: 266 [2024-11-08 20:19:50,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 432 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 20:19:50,470 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 57 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:19:50,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 159 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:19:50,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-08 20:19:50,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 244. [2024-11-08 20:19:50,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 155 states have (on average 1.070967741935484) internal successors, (166), 156 states have internal predecessors, (166), 68 states have call successors, (68), 20 states have call predecessors, (68), 20 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-08 20:19:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 302 transitions. [2024-11-08 20:19:50,513 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 302 transitions. Word has length 188 [2024-11-08 20:19:50,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:19:50,515 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 302 transitions. [2024-11-08 20:19:50,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2024-11-08 20:19:50,516 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 302 transitions. [2024-11-08 20:19:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-08 20:19:50,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:50,518 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:19:50,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 20:19:50,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:19:50,719 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:50,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash -518603425, now seen corresponding path program 1 times [2024-11-08 20:19:50,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:19:50,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299809811] [2024-11-08 20:19:50,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:50,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:19:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:19:50,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805128554] [2024-11-08 20:19:50,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:50,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:19:50,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:19:50,814 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:19:50,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 20:19:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:19:50,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 20:19:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:19:51,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 20:19:51,136 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 20:19:51,137 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 20:19:51,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 20:19:51,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:19:51,343 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:19:51,460 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 20:19:51,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 08:19:51 BoogieIcfgContainer [2024-11-08 20:19:51,462 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 20:19:51,463 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 20:19:51,463 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 20:19:51,463 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 20:19:51,463 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:19:01" (3/4) ... [2024-11-08 20:19:51,465 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 20:19:51,467 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 20:19:51,468 INFO L158 Benchmark]: Toolchain (without parser) took 51225.28ms. Allocated memory was 167.8MB in the beginning and 507.5MB in the end (delta: 339.7MB). Free memory was 98.5MB in the beginning and 430.8MB in the end (delta: -332.3MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-11-08 20:19:51,468 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:19:51,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.52ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 131.6MB in the end (delta: -33.4MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-11-08 20:19:51,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.17ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 128.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:19:51,469 INFO L158 Benchmark]: Boogie Preprocessor took 67.67ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 124.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:19:51,469 INFO L158 Benchmark]: RCFGBuilder took 635.86ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 99.5MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 20:19:51,469 INFO L158 Benchmark]: TraceAbstraction took 50069.38ms. Allocated memory was 167.8MB in the beginning and 507.5MB in the end (delta: 339.7MB). Free memory was 98.8MB in the beginning and 431.8MB in the end (delta: -333.0MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2024-11-08 20:19:51,470 INFO L158 Benchmark]: Witness Printer took 3.95ms. Allocated memory is still 507.5MB. Free memory was 431.8MB in the beginning and 430.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:19:51,471 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.52ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 131.6MB in the end (delta: -33.4MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.17ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 128.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.67ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 124.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 635.86ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 99.5MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 50069.38ms. Allocated memory was 167.8MB in the beginning and 507.5MB in the end (delta: 339.7MB). Free memory was 98.8MB in the beginning and 431.8MB in the end (delta: -333.0MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Witness Printer took 3.95ms. Allocated memory is still 507.5MB. Free memory was 431.8MB in the beginning and 430.8MB in the end (delta: 1.0MB). 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 167, overapproximation of someBinaryArithmeticDOUBLEoperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] signed char var_1_23 = 1; [L40] signed char var_1_24 = 2; [L41] signed short int var_1_25 = -500; [L42] signed char var_1_26 = -2; [L43] unsigned short int var_1_27 = 256; [L44] unsigned char var_1_28 = 0; [L45] unsigned short int var_1_29 = 39250; [L46] unsigned short int var_1_30 = 256; [L47] unsigned short int var_1_31 = 25; [L48] unsigned short int var_1_32 = 4; [L49] signed char var_1_33 = -8; [L50] signed char var_1_34 = -2; [L51] unsigned short int last_1_var_1_6 = 4; [L52] unsigned short int last_1_var_1_9 = 4; [L53] unsigned long int last_1_var_1_14 = 500; [L54] signed short int last_1_var_1_17 = 16; VAL [isInitial=0, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L171] isInitial = 1 [L172] FCALL initially() [L173] COND TRUE 1 [L174] CALL updateLastVariables() [L161] last_1_var_1_6 = var_1_6 [L162] last_1_var_1_9 = var_1_9 [L163] last_1_var_1_14 = var_1_14 [L164] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L174] RET updateLastVariables() [L175] CALL updateVariables() [L113] var_1_4 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_5=0, var_1_6=4, var_1_9=4] [L114] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_5=0, var_1_6=4, var_1_9=4] [L115] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L115] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L116] var_1_5 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_6=4, var_1_9=4] [L117] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_6=4, var_1_9=4] [L118] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L118] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L119] var_1_10 = __VERIFIER_nondet_ushort() [L120] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L120] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L121] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L121] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] var_1_12 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L123] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L124] var_1_13 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L125] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L126] var_1_15 = __VERIFIER_nondet_ulong() [L127] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L127] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L128] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L128] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L129] var_1_16 = __VERIFIER_nondet_ulong() [L130] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L130] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L131] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L131] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L132] var_1_19 = __VERIFIER_nondet_short() [L133] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L133] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L135] var_1_20 = __VERIFIER_nondet_short() [L136] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L136] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L137] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L137] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L138] var_1_21 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L139] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L140] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L140] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L141] var_1_22 = __VERIFIER_nondet_short() [L142] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L142] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L143] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L143] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L144] var_1_24 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_24 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L145] RET assume_abort_if_not(var_1_24 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L146] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L146] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L147] var_1_28 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L148] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L149] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L149] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L150] var_1_29 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L151] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L153] var_1_30 = __VERIFIER_nondet_ushort() [L154] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L154] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] CALL assume_abort_if_not(var_1_30 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] RET assume_abort_if_not(var_1_30 <= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] var_1_31 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L157] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] CALL assume_abort_if_not(var_1_31 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] RET assume_abort_if_not(var_1_31 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L175] RET updateVariables() [L176] CALL step() [L58] var_1_23 = var_1_24 [L59] var_1_25 = var_1_23 [L60] var_1_26 = var_1_24 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L61] COND TRUE \read(var_1_28) [L62] var_1_27 = (((((var_1_29 - var_1_30)) < (var_1_31)) ? ((var_1_29 - var_1_30)) : (var_1_31))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L64] var_1_32 = var_1_30 [L65] var_1_33 = var_1_24 [L66] var_1_34 = var_1_24 [L67] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L68] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L73] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L74] COND TRUE last_1_var_1_14 >= stepLocal_3 [L75] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L77] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L78] COND TRUE (- var_1_14) > var_1_6 [L79] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L84] unsigned char stepLocal_2 = var_1_4; [L85] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=-18, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L86] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=-18, var_1_10=0, var_1_11=78/5, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L89] COND TRUE stepLocal_1 >= var_1_6 [L90] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L95] unsigned char stepLocal_5 = var_1_1; [L96] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L97] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L104] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L105] COND TRUE ! var_1_1 [L106] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L176] RET step() [L177] CALL, EXPR property() [L167-L168] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L177] RET, EXPR property() [L177] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.9s, OverallIterations: 10, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1494 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1432 mSDsluCounter, 3561 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2435 mSDsCounter, 532 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2731 IncrementalHoareTripleChecker+Invalid, 3263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 532 mSolverCounterUnsat, 1126 mSDtfsCounter, 2731 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1828 GetRequests, 1657 SyntacticMatches, 4 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4797 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1203occurred in iteration=7, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 593 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 39.6s InterpolantComputationTime, 2629 NumberOfCodeBlocks, 2629 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2613 ConstructedInterpolants, 0 QuantifiedInterpolants, 12118 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1344 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 23535/24360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 20:19:51,609 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_fillercode_fillercodesize_ps-cn-10_file-4.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 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:19:53,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:19:53,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:19:53,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:19:53,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:19:53,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:19:53,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:19:53,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:19:53,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:19:53,758 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:19:53,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:19:53,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:19:53,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:19:53,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:19:53,761 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:19:53,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:19:53,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:19:53,762 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:19:53,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:19:53,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:19:53,763 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:19:53,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:19:53,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:19:53,764 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:19:53,764 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:19:53,764 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:19:53,764 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:19:53,765 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:19:53,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:19:53,765 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:19:53,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:19:53,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:19:53,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:19:53,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:19:53,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:19:53,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:19:53,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:19:53,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:19:53,768 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:19:53,768 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:19:53,768 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:19:53,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:19:53,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:19:53,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:19:53,770 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 -> 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 [2024-11-08 20:19:54,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:19:54,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:19:54,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:19:54,107 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:19:54,107 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:19:54,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-11-08 20:19:55,618 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:19:55,830 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:19:55,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-11-08 20:19:55,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69c23e860/7943a0a2b1eb4c91ba50ce8f7571edab/FLAG5545ad3bd [2024-11-08 20:19:55,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69c23e860/7943a0a2b1eb4c91ba50ce8f7571edab [2024-11-08 20:19:55,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:19:55,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:19:55,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:19:55,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:19:55,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:19:55,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:19:55" (1/1) ... [2024-11-08 20:19:55,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@522278af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:55, skipping insertion in model container [2024-11-08 20:19:55,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:19:55" (1/1) ... [2024-11-08 20:19:55,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:19:56,103 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i[914,927] [2024-11-08 20:19:56,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:19:56,207 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:19:56,221 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i[914,927] [2024-11-08 20:19:56,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:19:56,300 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:19:56,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:56 WrapperNode [2024-11-08 20:19:56,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:19:56,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:19:56,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:19:56,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:19:56,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:56" (1/1) ... [2024-11-08 20:19:56,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:56" (1/1) ... [2024-11-08 20:19:56,378 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-11-08 20:19:56,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:19:56,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:19:56,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:19:56,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:19:56,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:56" (1/1) ... [2024-11-08 20:19:56,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:56" (1/1) ... [2024-11-08 20:19:56,396 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:56" (1/1) ... [2024-11-08 20:19:56,416 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:19:56,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:56" (1/1) ... [2024-11-08 20:19:56,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:56" (1/1) ... [2024-11-08 20:19:56,430 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:56" (1/1) ... [2024-11-08 20:19:56,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:56" (1/1) ... [2024-11-08 20:19:56,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:56" (1/1) ... [2024-11-08 20:19:56,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:56" (1/1) ... [2024-11-08 20:19:56,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:19:56,457 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:19:56,457 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:19:56,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:19:56,458 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:56" (1/1) ... [2024-11-08 20:19:56,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:19:56,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:19:56,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:19:56,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:19:56,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:19:56,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:19:56,548 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:19:56,548 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:19:56,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:19:56,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:19:56,652 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:19:56,655 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:19:57,222 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 20:19:57,222 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:19:57,239 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:19:57,239 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:19:57,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:19:57 BoogieIcfgContainer [2024-11-08 20:19:57,240 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:19:57,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:19:57,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:19:57,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:19:57,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:19:55" (1/3) ... [2024-11-08 20:19:57,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283322ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:19:57, skipping insertion in model container [2024-11-08 20:19:57,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:19:56" (2/3) ... [2024-11-08 20:19:57,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283322ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:19:57, skipping insertion in model container [2024-11-08 20:19:57,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:19:57" (3/3) ... [2024-11-08 20:19:57,252 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-11-08 20:19:57,269 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:19:57,270 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:19:57,339 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:19:57,345 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;@1e2c16d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:19:57,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:19:57,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 20:19:57,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 20:19:57,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:57,364 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:19:57,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:57,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:57,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1783273033, now seen corresponding path program 1 times [2024-11-08 20:19:57,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:19:57,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138244914] [2024-11-08 20:19:57,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:57,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:19:57,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:19:57,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:19:57,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 20:19:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:57,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:19:57,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:19:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 610 proven. 0 refuted. 0 times theorem prover too weak. 1130 trivial. 0 not checked. [2024-11-08 20:19:57,780 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:19:57,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:19:57,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138244914] [2024-11-08 20:19:57,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138244914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:19:57,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:19:57,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:19:57,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788444702] [2024-11-08 20:19:57,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:19:57,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:19:57,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:19:57,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:19:57,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:19:57,830 INFO L87 Difference]: Start difference. First operand has 81 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) 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, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 20:19:57,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:19:57,861 INFO L93 Difference]: Finished difference Result 155 states and 274 transitions. [2024-11-08 20:19:57,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:19:57,863 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, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 186 [2024-11-08 20:19:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:19:57,869 INFO L225 Difference]: With dead ends: 155 [2024-11-08 20:19:57,869 INFO L226 Difference]: Without dead ends: 77 [2024-11-08 20:19:57,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:19:57,875 INFO L432 NwaCegarLoop]: 117 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, 117 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:19:57,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:19:57,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-08 20:19:57,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-08 20:19:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 20:19:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2024-11-08 20:19:57,920 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 186 [2024-11-08 20:19:57,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:19:57,923 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2024-11-08 20:19:57,924 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, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 20:19:57,924 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2024-11-08 20:19:57,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 20:19:57,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:19:57,928 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:19:57,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 20:19:58,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:19:58,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:19:58,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:19:58,130 INFO L85 PathProgramCache]: Analyzing trace with hash -579856256, now seen corresponding path program 1 times [2024-11-08 20:19:58,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:19:58,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811953171] [2024-11-08 20:19:58,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:19:58,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:19:58,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:19:58,134 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:19:58,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 20:19:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:19:58,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 20:19:58,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:19:59,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 279 proven. 159 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2024-11-08 20:19:59,528 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:20:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 9 proven. 162 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2024-11-08 20:20:00,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:20:00,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1811953171] [2024-11-08 20:20:00,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1811953171] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 20:20:00,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 20:20:00,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-08 20:20:00,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505774504] [2024-11-08 20:20:00,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 20:20:00,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 20:20:00,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:20:00,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 20:20:00,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-08 20:20:00,224 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2024-11-08 20:20:01,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:20:01,394 INFO L93 Difference]: Finished difference Result 177 states and 256 transitions. [2024-11-08 20:20:01,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 20:20:01,395 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 187 [2024-11-08 20:20:01,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:20:01,398 INFO L225 Difference]: With dead ends: 177 [2024-11-08 20:20:01,398 INFO L226 Difference]: Without dead ends: 103 [2024-11-08 20:20:01,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 359 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-11-08 20:20:01,401 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 133 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:20:01,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 296 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 20:20:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-08 20:20:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2024-11-08 20:20:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 20:20:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2024-11-08 20:20:01,418 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 187 [2024-11-08 20:20:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:20:01,419 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2024-11-08 20:20:01,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2024-11-08 20:20:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2024-11-08 20:20:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 20:20:01,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:20:01,423 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:20:01,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 20:20:01,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:20:01,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:20:01,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:20:01,625 INFO L85 PathProgramCache]: Analyzing trace with hash 407642383, now seen corresponding path program 1 times [2024-11-08 20:20:01,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:20:01,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111940684] [2024-11-08 20:20:01,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:20:01,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:20:01,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:20:01,628 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:20:01,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 20:20:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:20:01,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 20:20:01,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:20:02,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 20:20:02,232 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:20:02,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:20:02,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111940684] [2024-11-08 20:20:02,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111940684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:20:02,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:20:02,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:20:02,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304362153] [2024-11-08 20:20:02,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:20:02,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:20:02,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:20:02,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:20:02,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:20:02,237 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 20:20:03,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:20:03,155 INFO L93 Difference]: Finished difference Result 254 states and 353 transitions. [2024-11-08 20:20:03,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:20:03,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 188 [2024-11-08 20:20:03,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:20:03,161 INFO L225 Difference]: With dead ends: 254 [2024-11-08 20:20:03,164 INFO L226 Difference]: Without dead ends: 168 [2024-11-08 20:20:03,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:20:03,166 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 132 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 20:20:03,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 292 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 20:20:03,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-08 20:20:03,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2024-11-08 20:20:03,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 99 states have (on average 1.1111111111111112) internal successors, (110), 99 states have internal predecessors, (110), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 20:20:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 230 transitions. [2024-11-08 20:20:03,218 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 230 transitions. Word has length 188 [2024-11-08 20:20:03,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:20:03,219 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 230 transitions. [2024-11-08 20:20:03,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 20:20:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 230 transitions. [2024-11-08 20:20:03,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 20:20:03,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:20:03,222 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:20:03,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 20:20:03,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:20:03,423 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:20:03,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:20:03,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1087700753, now seen corresponding path program 1 times [2024-11-08 20:20:03,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:20:03,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839551812] [2024-11-08 20:20:03,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:20:03,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:20:03,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:20:03,427 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:20:03,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 20:20:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:20:03,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 20:20:03,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:20:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 717 proven. 63 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2024-11-08 20:20:04,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:20:05,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:20:05,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839551812] [2024-11-08 20:20:05,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839551812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:20:05,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [538320578] [2024-11-08 20:20:05,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:20:05,188 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 20:20:05,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 20:20:05,191 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 20:20:05,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-08 20:20:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:20:05,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 20:20:05,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:20:07,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 818 proven. 117 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-08 20:20:07,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:20:07,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [538320578] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:20:07,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 20:20:07,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2024-11-08 20:20:07,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232150531] [2024-11-08 20:20:07,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 20:20:07,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 20:20:07,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:20:07,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 20:20:07,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-08 20:20:07,562 INFO L87 Difference]: Start difference. First operand 166 states and 230 transitions. Second operand has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 16 states have internal predecessors, (89), 5 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) [2024-11-08 20:20:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:20:11,408 INFO L93 Difference]: Finished difference Result 451 states and 605 transitions. [2024-11-08 20:20:11,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 20:20:11,410 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 16 states have internal predecessors, (89), 5 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) Word has length 188 [2024-11-08 20:20:11,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:20:11,414 INFO L225 Difference]: With dead ends: 451 [2024-11-08 20:20:11,414 INFO L226 Difference]: Without dead ends: 288 [2024-11-08 20:20:11,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2024-11-08 20:20:11,420 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 304 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 20:20:11,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 533 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 20:20:11,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-08 20:20:11,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 268. [2024-11-08 20:20:11,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 162 states have (on average 1.0925925925925926) internal successors, (177), 162 states have internal predecessors, (177), 90 states have call successors, (90), 15 states have call predecessors, (90), 15 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 20:20:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 357 transitions. [2024-11-08 20:20:11,478 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 357 transitions. Word has length 188 [2024-11-08 20:20:11,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:20:11,478 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 357 transitions. [2024-11-08 20:20:11,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 16 states have internal predecessors, (89), 5 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) [2024-11-08 20:20:11,479 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 357 transitions. [2024-11-08 20:20:11,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 20:20:11,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:20:11,481 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:20:11,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 20:20:11,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-08 20:20:11,885 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-08 20:20:11,886 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:20:11,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:20:11,887 INFO L85 PathProgramCache]: Analyzing trace with hash 500894739, now seen corresponding path program 1 times [2024-11-08 20:20:11,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:20:11,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130898944] [2024-11-08 20:20:11,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:20:11,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:20:11,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:20:11,891 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:20:11,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 20:20:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:20:12,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 20:20:12,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:20:12,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 20:20:12,717 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:20:12,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:20:12,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130898944] [2024-11-08 20:20:12,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130898944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:20:12,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:20:12,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:20:12,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036238152] [2024-11-08 20:20:12,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:20:12,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:20:12,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:20:12,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:20:12,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:20:12,720 INFO L87 Difference]: Start difference. First operand 268 states and 357 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 20:20:13,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:20:13,354 INFO L93 Difference]: Finished difference Result 445 states and 590 transitions. [2024-11-08 20:20:13,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:20:13,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 188 [2024-11-08 20:20:13,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:20:13,367 INFO L225 Difference]: With dead ends: 445 [2024-11-08 20:20:13,367 INFO L226 Difference]: Without dead ends: 180 [2024-11-08 20:20:13,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:20:13,369 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 47 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 20:20:13,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 334 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 20:20:13,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-08 20:20:13,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 164. [2024-11-08 20:20:13,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 20:20:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 218 transitions. [2024-11-08 20:20:13,405 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 218 transitions. Word has length 188 [2024-11-08 20:20:13,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:20:13,405 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 218 transitions. [2024-11-08 20:20:13,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 20:20:13,406 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 218 transitions. [2024-11-08 20:20:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-08 20:20:13,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:20:13,408 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:20:13,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-08 20:20:13,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:20:13,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:20:13,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:20:13,614 INFO L85 PathProgramCache]: Analyzing trace with hash -518603425, now seen corresponding path program 1 times [2024-11-08 20:20:13,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:20:13,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688790587] [2024-11-08 20:20:13,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:20:13,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:20:13,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:20:13,618 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:20:13,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-08 20:20:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:20:13,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 20:20:13,795 INFO L278 TraceCheckSpWp]: Computing forward predicates...