./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f42cef6ed93900b31f047f50e8a562d6414688ebc2967397026af436d35c76fd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:33:14,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:33:14,513 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:33:14,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:33:14,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:33:14,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:33:14,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:33:14,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:33:14,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:33:14,547 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:33:14,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:33:14,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:33:14,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:33:14,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:33:14,549 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:33:14,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:33:14,550 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:33:14,552 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:33:14,552 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:33:14,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:33:14,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:33:14,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:33:14,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:33:14,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:33:14,553 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:33:14,554 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:33:14,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:33:14,554 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:33:14,554 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:33:14,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:33:14,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:33:14,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:33:14,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:33:14,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:33:14,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:33:14,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:33:14,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:33:14,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:33:14,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:33:14,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:33:14,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:33:14,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:33:14,557 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 -> f42cef6ed93900b31f047f50e8a562d6414688ebc2967397026af436d35c76fd [2024-11-08 22:33:14,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:33:14,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:33:14,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:33:14,789 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:33:14,790 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:33:14,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-1.i [2024-11-08 22:33:15,935 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:33:16,103 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:33:16,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-1.i [2024-11-08 22:33:16,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba1b7cbf8/5bd3846b50154631937093d5e0031993/FLAGfbbe220b0 [2024-11-08 22:33:16,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba1b7cbf8/5bd3846b50154631937093d5e0031993 [2024-11-08 22:33:16,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:33:16,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:33:16,134 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:33:16,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:33:16,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:33:16,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:33:16" (1/1) ... [2024-11-08 22:33:16,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f4da322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:16, skipping insertion in model container [2024-11-08 22:33:16,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:33:16" (1/1) ... [2024-11-08 22:33:16,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:33:16,296 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-1.i[918,931] [2024-11-08 22:33:16,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:33:16,356 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:33:16,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-1.i[918,931] [2024-11-08 22:33:16,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:33:16,405 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:33:16,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:16 WrapperNode [2024-11-08 22:33:16,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:33:16,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:33:16,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:33:16,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:33:16,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:16" (1/1) ... [2024-11-08 22:33:16,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:16" (1/1) ... [2024-11-08 22:33:16,451 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2024-11-08 22:33:16,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:33:16,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:33:16,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:33:16,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:33:16,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:16" (1/1) ... [2024-11-08 22:33:16,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:16" (1/1) ... [2024-11-08 22:33:16,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:16" (1/1) ... [2024-11-08 22:33:16,485 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:33:16,486 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:16" (1/1) ... [2024-11-08 22:33:16,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:16" (1/1) ... [2024-11-08 22:33:16,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:16" (1/1) ... [2024-11-08 22:33:16,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:16" (1/1) ... [2024-11-08 22:33:16,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:16" (1/1) ... [2024-11-08 22:33:16,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:16" (1/1) ... [2024-11-08 22:33:16,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:33:16,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:33:16,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:33:16,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:33:16,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:16" (1/1) ... [2024-11-08 22:33:16,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:33:16,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:33:16,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:33:16,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:33:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:33:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:33:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:33:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:33:16,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:33:16,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:33:16,638 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:33:16,640 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:33:16,986 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 22:33:16,987 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:33:17,004 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:33:17,005 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:33:17,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:33:17 BoogieIcfgContainer [2024-11-08 22:33:17,005 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:33:17,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:33:17,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:33:17,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:33:17,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:33:16" (1/3) ... [2024-11-08 22:33:17,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1adc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:33:17, skipping insertion in model container [2024-11-08 22:33:17,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:16" (2/3) ... [2024-11-08 22:33:17,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1adc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:33:17, skipping insertion in model container [2024-11-08 22:33:17,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:33:17" (3/3) ... [2024-11-08 22:33:17,014 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-1.i [2024-11-08 22:33:17,029 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:33:17,029 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:33:17,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:33:17,178 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;@33d75143, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:33:17,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:33:17,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 22:33:17,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 22:33:17,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:17,203 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:17,204 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:17,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:17,209 INFO L85 PathProgramCache]: Analyzing trace with hash -971744553, now seen corresponding path program 1 times [2024-11-08 22:33:17,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:33:17,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807987195] [2024-11-08 22:33:17,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:17,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:33:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:33:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:33:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:33:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:33:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:33:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:33:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:33:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:33:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:33:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:33:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:33:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:33:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:33:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:33:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:33:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:33:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:33:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:33:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:33:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 22:33:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:33:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 22:33:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:33:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:33:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:33:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:33:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:33:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:33:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:33:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:33:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:33:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:33:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 22:33:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 22:33:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 22:33:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 22:33:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 22:33:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 22:33:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 22:33:17,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:33:17,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807987195] [2024-11-08 22:33:17,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807987195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:17,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:17,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:33:17,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072697703] [2024-11-08 22:33:17,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:17,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:33:17,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:33:17,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:33:17,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:33:17,697 INFO L87 Difference]: Start difference. First operand has 109 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-08 22:33:17,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:17,724 INFO L93 Difference]: Finished difference Result 211 states and 381 transitions. [2024-11-08 22:33:17,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:33:17,727 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) Word has length 244 [2024-11-08 22:33:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:17,733 INFO L225 Difference]: With dead ends: 211 [2024-11-08 22:33:17,734 INFO L226 Difference]: Without dead ends: 105 [2024-11-08 22:33:17,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:33:17,743 INFO L432 NwaCegarLoop]: 166 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, 166 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:17,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:33:17,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-08 22:33:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-08 22:33:17,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 22:33:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 166 transitions. [2024-11-08 22:33:17,790 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 166 transitions. Word has length 244 [2024-11-08 22:33:17,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:17,791 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 166 transitions. [2024-11-08 22:33:17,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-08 22:33:17,791 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 166 transitions. [2024-11-08 22:33:17,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 22:33:17,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:17,796 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:17,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:33:17,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:17,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:17,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1462909353, now seen corresponding path program 1 times [2024-11-08 22:33:17,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:33:17,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333494580] [2024-11-08 22:33:17,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:17,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:33:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:33:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:33:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:33:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:33:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:33:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:33:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:33:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:33:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:33:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:33:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:33:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:33:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:33:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:33:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:33:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:33:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:33:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:33:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:33:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 22:33:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:33:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 22:33:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:33:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:33:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:33:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:33:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:33:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:33:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:33:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:33:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:33:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:33:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 22:33:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 22:33:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 22:33:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 22:33:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 22:33:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 22:33:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 22:33:18,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:33:18,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333494580] [2024-11-08 22:33:18,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333494580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:18,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:18,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:33:18,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674123076] [2024-11-08 22:33:18,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:18,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:33:18,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:33:18,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:33:18,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:18,135 INFO L87 Difference]: Start difference. First operand 105 states and 166 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:18,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:18,212 INFO L93 Difference]: Finished difference Result 207 states and 329 transitions. [2024-11-08 22:33:18,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:33:18,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 244 [2024-11-08 22:33:18,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:18,217 INFO L225 Difference]: With dead ends: 207 [2024-11-08 22:33:18,219 INFO L226 Difference]: Without dead ends: 105 [2024-11-08 22:33:18,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:18,223 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:18,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:33:18,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-08 22:33:18,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-08 22:33:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 64 states have (on average 1.359375) internal successors, (87), 64 states have internal predecessors, (87), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 22:33:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 165 transitions. [2024-11-08 22:33:18,240 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 165 transitions. Word has length 244 [2024-11-08 22:33:18,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:18,241 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 165 transitions. [2024-11-08 22:33:18,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 165 transitions. [2024-11-08 22:33:18,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-08 22:33:18,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:18,245 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:18,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:33:18,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:18,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:18,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1570543750, now seen corresponding path program 1 times [2024-11-08 22:33:18,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:33:18,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561996385] [2024-11-08 22:33:18,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:18,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:33:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:33:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:33:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:33:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:33:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:33:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:33:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:33:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:33:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:33:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:33:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:33:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:33:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:33:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:33:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:33:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:33:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:33:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:33:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:33:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 22:33:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:33:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 22:33:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:33:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:33:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:33:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:33:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:33:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:33:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:33:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:33:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:33:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:33:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 22:33:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 22:33:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 22:33:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 22:33:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 22:33:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 22:33:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 22:33:18,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:33:18,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561996385] [2024-11-08 22:33:18,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561996385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:18,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:18,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:33:18,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304467016] [2024-11-08 22:33:18,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:18,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:33:18,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:33:18,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:33:18,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:18,438 INFO L87 Difference]: Start difference. First operand 105 states and 165 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:18,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:18,504 INFO L93 Difference]: Finished difference Result 307 states and 485 transitions. [2024-11-08 22:33:18,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:33:18,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 245 [2024-11-08 22:33:18,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:18,508 INFO L225 Difference]: With dead ends: 307 [2024-11-08 22:33:18,510 INFO L226 Difference]: Without dead ends: 205 [2024-11-08 22:33:18,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:18,512 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 151 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:18,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 447 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:33:18,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-08 22:33:18,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2024-11-08 22:33:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 122 states have (on average 1.3360655737704918) internal successors, (163), 122 states have internal predecessors, (163), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-08 22:33:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 319 transitions. [2024-11-08 22:33:18,550 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 319 transitions. Word has length 245 [2024-11-08 22:33:18,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:18,552 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 319 transitions. [2024-11-08 22:33:18,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:18,553 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 319 transitions. [2024-11-08 22:33:18,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-08 22:33:18,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:18,555 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:18,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:33:18,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:18,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:18,556 INFO L85 PathProgramCache]: Analyzing trace with hash 752895300, now seen corresponding path program 1 times [2024-11-08 22:33:18,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:33:18,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117816784] [2024-11-08 22:33:18,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:18,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:33:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:33:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:33:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:33:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:33:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:33:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:33:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:33:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:33:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:33:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:33:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:33:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:33:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:33:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:33:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:33:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:33:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:33:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:33:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:33:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 22:33:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:33:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 22:33:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:33:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:33:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:33:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:33:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:33:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:33:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:33:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:33:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:33:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:33:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 22:33:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 22:33:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 22:33:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 22:33:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 22:33:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 22:33:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 22:33:18,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:33:18,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117816784] [2024-11-08 22:33:18,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117816784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:18,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:18,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:33:18,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983842595] [2024-11-08 22:33:18,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:18,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:33:18,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:33:18,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:33:18,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:18,726 INFO L87 Difference]: Start difference. First operand 203 states and 319 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:18,783 INFO L93 Difference]: Finished difference Result 486 states and 763 transitions. [2024-11-08 22:33:18,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:33:18,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 245 [2024-11-08 22:33:18,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:18,787 INFO L225 Difference]: With dead ends: 486 [2024-11-08 22:33:18,788 INFO L226 Difference]: Without dead ends: 286 [2024-11-08 22:33:18,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:18,790 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 139 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:18,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 308 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:33:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-08 22:33:18,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2024-11-08 22:33:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 163 states have (on average 1.2760736196319018) internal successors, (208), 163 states have internal predecessors, (208), 117 states have call successors, (117), 3 states have call predecessors, (117), 3 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-08 22:33:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 442 transitions. [2024-11-08 22:33:18,826 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 442 transitions. Word has length 245 [2024-11-08 22:33:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:18,826 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 442 transitions. [2024-11-08 22:33:18,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 442 transitions. [2024-11-08 22:33:18,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 22:33:18,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:18,829 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:18,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 22:33:18,829 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:18,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:18,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1918419741, now seen corresponding path program 1 times [2024-11-08 22:33:18,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:33:18,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664887944] [2024-11-08 22:33:18,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:18,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:33:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:33:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:33:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:33:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:33:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:33:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:33:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:33:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:33:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:33:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:33:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:33:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:33:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:33:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:33:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:33:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:18,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:33:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:33:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:33:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:33:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 22:33:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:33:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 22:33:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:33:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:33:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:33:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:33:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:33:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:33:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:33:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:33:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:33:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:33:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 22:33:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 22:33:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 22:33:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 22:33:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 22:33:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 22:33:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 22:33:19,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:33:19,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664887944] [2024-11-08 22:33:19,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664887944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:19,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:19,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:33:19,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131505111] [2024-11-08 22:33:19,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:19,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:33:19,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:33:19,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:33:19,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:19,049 INFO L87 Difference]: Start difference. First operand 284 states and 442 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:19,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:19,116 INFO L93 Difference]: Finished difference Result 568 states and 887 transitions. [2024-11-08 22:33:19,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:33:19,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 246 [2024-11-08 22:33:19,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:19,120 INFO L225 Difference]: With dead ends: 568 [2024-11-08 22:33:19,120 INFO L226 Difference]: Without dead ends: 287 [2024-11-08 22:33:19,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:19,123 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:19,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:33:19,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-08 22:33:19,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-11-08 22:33:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 166 states have (on average 1.2710843373493976) internal successors, (211), 166 states have internal predecessors, (211), 117 states have call successors, (117), 3 states have call predecessors, (117), 3 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-08 22:33:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 445 transitions. [2024-11-08 22:33:19,152 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 445 transitions. Word has length 246 [2024-11-08 22:33:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:19,154 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 445 transitions. [2024-11-08 22:33:19,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 445 transitions. [2024-11-08 22:33:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 22:33:19,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:19,157 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:19,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 22:33:19,157 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:19,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:19,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1784406235, now seen corresponding path program 1 times [2024-11-08 22:33:19,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:33:19,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750107494] [2024-11-08 22:33:19,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:19,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:33:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:33:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:33:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:33:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:33:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:33:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:33:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:33:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:33:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:33:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:33:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:33:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:33:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:33:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:33:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:33:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:33:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:33:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:33:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:33:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 22:33:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:33:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 22:33:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:33:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:33:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:33:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:33:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:33:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:33:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:33:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:33:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:33:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:33:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 22:33:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 22:33:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 22:33:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 22:33:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 22:33:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 22:33:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 22:33:19,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:33:19,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750107494] [2024-11-08 22:33:19,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750107494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:19,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:19,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:33:19,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486988093] [2024-11-08 22:33:19,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:19,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:33:19,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:33:19,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:33:19,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:19,345 INFO L87 Difference]: Start difference. First operand 287 states and 445 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:19,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:19,404 INFO L93 Difference]: Finished difference Result 596 states and 926 transitions. [2024-11-08 22:33:19,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:33:19,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 246 [2024-11-08 22:33:19,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:19,407 INFO L225 Difference]: With dead ends: 596 [2024-11-08 22:33:19,407 INFO L226 Difference]: Without dead ends: 312 [2024-11-08 22:33:19,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:19,408 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 14 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:19,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 286 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:33:19,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-08 22:33:19,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 303. [2024-11-08 22:33:19,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 182 states have (on average 1.2637362637362637) internal successors, (230), 182 states have internal predecessors, (230), 117 states have call successors, (117), 3 states have call predecessors, (117), 3 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-08 22:33:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 464 transitions. [2024-11-08 22:33:19,432 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 464 transitions. Word has length 246 [2024-11-08 22:33:19,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:19,432 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 464 transitions. [2024-11-08 22:33:19,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:19,433 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 464 transitions. [2024-11-08 22:33:19,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 22:33:19,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:19,435 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:19,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 22:33:19,435 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:19,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:19,436 INFO L85 PathProgramCache]: Analyzing trace with hash 966757785, now seen corresponding path program 1 times [2024-11-08 22:33:19,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:33:19,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370940421] [2024-11-08 22:33:19,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:19,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:33:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:33:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:33:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:33:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:33:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:33:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:33:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:33:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:33:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:33:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:33:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:33:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:33:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:33:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:33:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:33:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:33:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:33:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:33:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:33:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 22:33:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:33:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 22:33:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:33:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:33:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:33:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:33:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:33:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:33:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:33:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:33:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:33:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:33:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 22:33:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 22:33:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 22:33:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 22:33:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 22:33:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 22:33:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 22:33:19,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:33:19,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370940421] [2024-11-08 22:33:19,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370940421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:19,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:19,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:33:19,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946196964] [2024-11-08 22:33:19,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:19,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:33:19,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:33:19,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:33:19,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:19,732 INFO L87 Difference]: Start difference. First operand 303 states and 464 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:19,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:19,807 INFO L93 Difference]: Finished difference Result 684 states and 1052 transitions. [2024-11-08 22:33:19,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:33:19,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 246 [2024-11-08 22:33:19,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:19,826 INFO L225 Difference]: With dead ends: 684 [2024-11-08 22:33:19,826 INFO L226 Difference]: Without dead ends: 384 [2024-11-08 22:33:19,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:19,827 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 61 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:19,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 281 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:33:19,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-08 22:33:19,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2024-11-08 22:33:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 213 states have internal predecessors, (262), 156 states have call successors, (156), 4 states have call predecessors, (156), 4 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-08 22:33:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 574 transitions. [2024-11-08 22:33:19,865 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 574 transitions. Word has length 246 [2024-11-08 22:33:19,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:19,866 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 574 transitions. [2024-11-08 22:33:19,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 574 transitions. [2024-11-08 22:33:19,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-08 22:33:19,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:19,868 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:19,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 22:33:19,869 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:19,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:19,869 INFO L85 PathProgramCache]: Analyzing trace with hash 323945662, now seen corresponding path program 1 times [2024-11-08 22:33:19,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:33:19,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381377109] [2024-11-08 22:33:19,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:19,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:33:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:33:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:33:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:33:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:33:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:33:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:33:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:33:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:33:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:33:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:33:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:33:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:33:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:33:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:33:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:33:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:33:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:33:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:33:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:33:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 22:33:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:33:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 22:33:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:33:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:33:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:33:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:33:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:33:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:33:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:33:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:33:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:33:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:33:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 22:33:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 22:33:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 22:33:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 22:33:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 22:33:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 22:33:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 22:33:20,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:33:20,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381377109] [2024-11-08 22:33:20,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381377109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:20,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:20,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:33:20,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874784086] [2024-11-08 22:33:20,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:20,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:33:20,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:33:20,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:33:20,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:33:20,119 INFO L87 Difference]: Start difference. First operand 374 states and 574 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:20,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:20,356 INFO L93 Difference]: Finished difference Result 923 states and 1422 transitions. [2024-11-08 22:33:20,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:33:20,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 249 [2024-11-08 22:33:20,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:20,360 INFO L225 Difference]: With dead ends: 923 [2024-11-08 22:33:20,360 INFO L226 Difference]: Without dead ends: 623 [2024-11-08 22:33:20,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:33:20,361 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 143 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:20,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 554 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:33:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-08 22:33:20,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 612. [2024-11-08 22:33:20,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 331 states have (on average 1.190332326283988) internal successors, (394), 331 states have internal predecessors, (394), 273 states have call successors, (273), 7 states have call predecessors, (273), 7 states have return successors, (273), 273 states have call predecessors, (273), 273 states have call successors, (273) [2024-11-08 22:33:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 940 transitions. [2024-11-08 22:33:20,407 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 940 transitions. Word has length 249 [2024-11-08 22:33:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:20,407 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 940 transitions. [2024-11-08 22:33:20,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 940 transitions. [2024-11-08 22:33:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-08 22:33:20,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:20,409 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:20,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 22:33:20,410 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:20,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:20,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1025010240, now seen corresponding path program 1 times [2024-11-08 22:33:20,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:33:20,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479325180] [2024-11-08 22:33:20,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:20,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:33:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:33:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:33:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:33:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:33:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:33:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:33:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:33:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:33:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:33:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:33:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:33:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:33:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:33:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:33:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:33:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:33:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:33:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:33:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:33:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 22:33:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:33:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 22:33:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:33:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:33:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:33:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:33:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:33:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:33:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:33:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:33:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:33:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 22:33:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 22:33:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 22:33:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 22:33:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:20,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 22:33:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:21,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 22:33:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:21,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 22:33:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:21,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2024-11-08 22:33:21,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:33:21,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479325180] [2024-11-08 22:33:21,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479325180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:33:21,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784070476] [2024-11-08 22:33:21,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:21,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:33:21,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:33:21,015 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:33:21,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 22:33:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:21,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 22:33:21,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:33:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1140 proven. 27 refuted. 0 times theorem prover too weak. 1797 trivial. 0 not checked. [2024-11-08 22:33:22,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:33:22,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784070476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:33:22,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 22:33:22,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2024-11-08 22:33:22,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447752196] [2024-11-08 22:33:22,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 22:33:22,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 22:33:22,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:33:22,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 22:33:22,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-08 22:33:22,489 INFO L87 Difference]: Start difference. First operand 612 states and 940 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 4 states have call successors, (78), 3 states have call predecessors, (78), 5 states have return successors, (78), 4 states have call predecessors, (78), 4 states have call successors, (78) [2024-11-08 22:33:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:23,080 INFO L93 Difference]: Finished difference Result 1178 states and 1798 transitions. [2024-11-08 22:33:23,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 22:33:23,081 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 4 states have call successors, (78), 3 states have call predecessors, (78), 5 states have return successors, (78), 4 states have call predecessors, (78), 4 states have call successors, (78) Word has length 249 [2024-11-08 22:33:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:23,085 INFO L225 Difference]: With dead ends: 1178 [2024-11-08 22:33:23,085 INFO L226 Difference]: Without dead ends: 640 [2024-11-08 22:33:23,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-11-08 22:33:23,087 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 93 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:23,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 567 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 22:33:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-08 22:33:23,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 622. [2024-11-08 22:33:23,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 340 states have (on average 1.1911764705882353) internal successors, (405), 340 states have internal predecessors, (405), 273 states have call successors, (273), 8 states have call predecessors, (273), 8 states have return successors, (273), 273 states have call predecessors, (273), 273 states have call successors, (273) [2024-11-08 22:33:23,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 951 transitions. [2024-11-08 22:33:23,123 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 951 transitions. Word has length 249 [2024-11-08 22:33:23,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:23,123 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 951 transitions. [2024-11-08 22:33:23,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 4 states have call successors, (78), 3 states have call predecessors, (78), 5 states have return successors, (78), 4 states have call predecessors, (78), 4 states have call successors, (78) [2024-11-08 22:33:23,124 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 951 transitions. [2024-11-08 22:33:23,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-08 22:33:23,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:23,125 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:23,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 22:33:23,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:33:23,330 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:23,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash -969134466, now seen corresponding path program 1 times [2024-11-08 22:33:23,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:33:23,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327317932] [2024-11-08 22:33:23,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:23,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:33:23,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [983486750] [2024-11-08 22:33:23,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:23,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:33:23,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:33:23,416 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:33:23,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 22:33:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:33:23,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:33:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:33:23,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:33:23,739 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:33:23,740 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:33:23,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 22:33:23,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 22:33:23,944 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:24,066 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:33:24,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:33:24 BoogieIcfgContainer [2024-11-08 22:33:24,068 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:33:24,068 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:33:24,068 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:33:24,069 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:33:24,069 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:33:17" (3/4) ... [2024-11-08 22:33:24,071 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:33:24,072 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:33:24,073 INFO L158 Benchmark]: Toolchain (without parser) took 7942.78ms. Allocated memory was 184.5MB in the beginning and 318.8MB in the end (delta: 134.2MB). Free memory was 117.1MB in the beginning and 192.7MB in the end (delta: -75.6MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2024-11-08 22:33:24,073 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 125.8MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:33:24,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.21ms. Allocated memory is still 184.5MB. Free memory was 117.1MB in the beginning and 98.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 22:33:24,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.42ms. Allocated memory is still 184.5MB. Free memory was 98.2MB in the beginning and 94.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:33:24,074 INFO L158 Benchmark]: Boogie Preprocessor took 56.96ms. Allocated memory is still 184.5MB. Free memory was 94.1MB in the beginning and 88.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:33:24,074 INFO L158 Benchmark]: RCFGBuilder took 495.94ms. Allocated memory is still 184.5MB. Free memory was 88.8MB in the beginning and 58.4MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 22:33:24,074 INFO L158 Benchmark]: TraceAbstraction took 7061.06ms. Allocated memory was 184.5MB in the beginning and 318.8MB in the end (delta: 134.2MB). Free memory was 57.9MB in the beginning and 192.7MB in the end (delta: -134.9MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. [2024-11-08 22:33:24,074 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 318.8MB. Free memory is still 192.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:33:24,076 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.23ms. Allocated memory is still 125.8MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.21ms. Allocated memory is still 184.5MB. Free memory was 117.1MB in the beginning and 98.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.42ms. Allocated memory is still 184.5MB. Free memory was 98.2MB in the beginning and 94.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.96ms. Allocated memory is still 184.5MB. Free memory was 94.1MB in the beginning and 88.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 495.94ms. Allocated memory is still 184.5MB. Free memory was 88.8MB in the beginning and 58.4MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7061.06ms. Allocated memory was 184.5MB in the beginning and 318.8MB in the end (delta: 134.2MB). Free memory was 57.9MB in the beginning and 192.7MB in the end (delta: -134.9MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 318.8MB. Free memory is still 192.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 204, overapproximation of bitwiseOr at line 61, overapproximation of shiftRight at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 204. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] double var_1_6 = 31.5; [L24] double var_1_9 = 1000000000.25; [L25] float var_1_10 = 1.1; [L26] float var_1_11 = 8.75; [L27] float var_1_12 = 63.8; [L28] unsigned char var_1_13 = 1; [L29] float var_1_14 = 127.5; [L30] signed char var_1_15 = -2; [L31] signed char var_1_16 = 1; [L32] signed char var_1_17 = 1; [L33] signed char var_1_18 = 1; [L34] signed char var_1_19 = -2; [L35] signed char var_1_20 = 16; [L36] signed char var_1_21 = 2; [L37] signed char var_1_22 = 8; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 0; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_26 = 0; [L42] unsigned char var_1_27 = 32; [L43] unsigned char var_1_28 = 1; [L44] unsigned long int var_1_33 = 10; [L45] unsigned long int var_1_35 = 2632045268; [L46] signed long int var_1_36 = 32; [L47] unsigned long int var_1_37 = 128; [L48] unsigned long int var_1_39 = 1877460848; [L49] unsigned long int var_1_40 = 1831388024; [L50] unsigned long int var_1_41 = 1967003719; [L51] unsigned char var_1_42 = 0; [L52] unsigned char var_1_43 = 0; [L53] unsigned char var_1_45 = 0; [L54] unsigned char var_1_46 = 0; [L55] unsigned char var_1_47 = 1; [L56] unsigned char var_1_48 = 1; [L57] unsigned short int var_1_49 = 0; VAL [isInitial=0, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2, var_1_9=4000000001/4] [L208] isInitial = 1 [L209] FCALL initially() [L210] COND TRUE 1 [L211] FCALL updateLastVariables() [L212] CALL updateVariables() [L140] var_1_9 = __VERIFIER_nondet_double() [L141] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L141] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L142] var_1_11 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L143] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L144] var_1_13 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L145] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L146] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L146] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L147] var_1_14 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L148] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L149] var_1_16 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_16 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L150] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L151] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L151] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L152] var_1_17 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L153] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L154] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L154] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L155] var_1_19 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L156] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L157] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L157] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L158] var_1_20 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L159] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L160] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L160] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L161] var_1_21 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L162] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L163] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L163] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L164] var_1_22 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_22 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L165] RET assume_abort_if_not(var_1_22 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L166] CALL assume_abort_if_not(var_1_22 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L166] RET assume_abort_if_not(var_1_22 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L167] var_1_24 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L168] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L169] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L169] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L170] var_1_25 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L171] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L172] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L172] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L173] var_1_26 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L174] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L175] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L175] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L176] var_1_35 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_35 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L177] RET assume_abort_if_not(var_1_35 >= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L178] CALL assume_abort_if_not(var_1_35 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L178] RET assume_abort_if_not(var_1_35 <= 4294967294) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L179] var_1_39 = __VERIFIER_nondet_ulong() [L180] CALL assume_abort_if_not(var_1_39 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L180] RET assume_abort_if_not(var_1_39 >= 1073741823) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L181] CALL assume_abort_if_not(var_1_39 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L181] RET assume_abort_if_not(var_1_39 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L182] var_1_40 = __VERIFIER_nondet_ulong() [L183] CALL assume_abort_if_not(var_1_40 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L183] RET assume_abort_if_not(var_1_40 >= 1073741824) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L184] CALL assume_abort_if_not(var_1_40 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L184] RET assume_abort_if_not(var_1_40 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L185] var_1_41 = __VERIFIER_nondet_ulong() [L186] CALL assume_abort_if_not(var_1_41 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L186] RET assume_abort_if_not(var_1_41 >= 1073741824) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L187] CALL assume_abort_if_not(var_1_41 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L187] RET assume_abort_if_not(var_1_41 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L188] var_1_43 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L189] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L190] CALL assume_abort_if_not(var_1_43 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L190] RET assume_abort_if_not(var_1_43 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L191] var_1_45 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L192] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L193] CALL assume_abort_if_not(var_1_45 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L193] RET assume_abort_if_not(var_1_45 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L194] var_1_47 = __VERIFIER_nondet_uchar() [L195] CALL assume_abort_if_not(var_1_47 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L195] RET assume_abort_if_not(var_1_47 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L196] CALL assume_abort_if_not(var_1_47 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L196] RET assume_abort_if_not(var_1_47 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L197] var_1_48 = __VERIFIER_nondet_uchar() [L198] CALL assume_abort_if_not(var_1_48 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L198] RET assume_abort_if_not(var_1_48 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L199] CALL assume_abort_if_not(var_1_48 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L199] RET assume_abort_if_not(var_1_48 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L212] RET updateVariables() [L213] CALL step() [L61] EXPR var_1_27 | (var_1_27 + var_1_27) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L61] COND TRUE var_1_27 < (var_1_27 | (var_1_27 + var_1_27)) [L62] var_1_28 = 200 VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L64] EXPR var_1_27 >> var_1_27 VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L64] COND TRUE var_1_27 >= (var_1_27 >> var_1_27) [L65] COND FALSE !(var_1_23 || (var_1_27 < var_1_27)) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L69] COND TRUE var_1_27 > (var_1_27 / var_1_35) [L70] var_1_36 = ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=2, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L72] COND TRUE 63.75f <= var_1_10 [L73] var_1_37 = ((var_1_39 + ((((var_1_40) > (var_1_41)) ? (var_1_40) : (var_1_41)))) - ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=2, var_1_37=2147483645, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L75] COND FALSE !(var_1_41 < ((((var_1_27) < (var_1_1)) ? (var_1_27) : (var_1_1)))) [L78] var_1_42 = (var_1_45 || var_1_43) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=2, var_1_37=2147483645, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L80] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=2, var_1_37=2147483645, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L87] COND FALSE !((var_1_39 - ((((-50) < 0 ) ? -(-50) : (-50)))) < var_1_18) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=2, var_1_37=2147483645, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L92] var_1_15 = (var_1_16 - var_1_17) [L93] var_1_27 = var_1_21 [L94] unsigned char stepLocal_1 = var_1_27; [L95] unsigned char stepLocal_0 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=2, var_1_37=2147483645, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L96] COND TRUE (var_1_27 + var_1_27) <= stepLocal_1 [L97] var_1_1 = (128 + var_1_27) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=2, var_1_37=2147483645, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L105] COND FALSE !(var_1_27 < (var_1_27 - var_1_27)) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=2, var_1_37=2147483645, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L108] unsigned char stepLocal_2 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=2, var_1_37=2147483645, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L109] COND FALSE !(var_1_27 > stepLocal_2) [L112] var_1_10 = 9.75f VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=2, var_1_37=2147483645, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L114] COND TRUE ((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u [L115] var_1_18 = (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=2, var_1_37=2147483645, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L117] signed long int stepLocal_5 = ~ var_1_21; VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=2, var_1_37=2147483645, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L118] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=2, var_1_37=2147483645, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L127] unsigned char stepLocal_4 = var_1_18 >= var_1_27; [L128] unsigned char stepLocal_3 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=1, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=2, var_1_37=2147483645, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L129] COND FALSE !(var_1_23 && stepLocal_4) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=2, var_1_37=2147483645, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L132] COND TRUE 1 >= stepLocal_3 [L133] var_1_12 = var_1_11 VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=2, var_1_37=2147483645, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L213] RET step() [L214] CALL, EXPR property() [L204-L205] return (((((((((var_1_27 + var_1_27) <= var_1_27) ? (var_1_1 == ((signed short int) (128 + var_1_27))) : ((var_1_27 >= (var_1_27 * var_1_27)) ? (var_1_1 == ((signed short int) var_1_27)) : (var_1_1 == ((signed short int) 1)))) && ((var_1_27 < (var_1_27 - var_1_27)) ? (var_1_6 == ((double) var_1_9)) : 1)) && ((var_1_27 > var_1_27) ? (var_1_10 == ((float) (1.00000000000009E13f - var_1_11))) : (var_1_10 == ((float) 9.75f)))) && ((var_1_23 && (var_1_18 >= var_1_27)) ? (var_1_12 == ((float) var_1_11)) : ((1 >= var_1_27) ? (var_1_12 == ((float) var_1_11)) : (var_1_12 == ((float) var_1_14))))) && (var_1_15 == ((signed char) (var_1_16 - var_1_17)))) && ((((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u) ? (var_1_18 == ((signed char) (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))))) : 1)) && (var_1_13 ? (((~ var_1_21) > var_1_27) ? (var_1_23 == ((unsigned char) (var_1_24 && (! var_1_25)))) : (var_1_24 ? (var_1_23 == ((unsigned char) ((! var_1_25) || var_1_26))) : 1)) : 1)) && (var_1_27 == ((unsigned char) var_1_21)) ; VAL [\result=0, isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=2, var_1_37=2147483645, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L214] RET, EXPR property() [L214] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=2, var_1_37=2147483645, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L19] reach_error() VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_33=10, var_1_35=2147483647, var_1_36=2, var_1_37=2147483645, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 10, TraceHistogramMax: 39, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 630 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 601 mSDsluCounter, 3195 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1558 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 945 IncrementalHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 1637 mSDtfsCounter, 945 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1052 GetRequests, 1030 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=622occurred in iteration=9, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 52 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2961 NumberOfCodeBlocks, 2961 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2453 ConstructedInterpolants, 0 QuantifiedInterpolants, 5888 SizeOfPredicates, 1 NumberOfNonLiveVariables, 549 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 29586/29640 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 22:33:24,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f42cef6ed93900b31f047f50e8a562d6414688ebc2967397026af436d35c76fd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:33:25,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:33:25,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:33:25,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:33:25,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:33:25,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:33:25,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:33:25,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:33:25,994 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:33:25,995 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:33:25,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:33:25,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:33:25,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:33:25,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:33:25,996 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:33:25,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:33:25,996 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:33:25,997 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:33:25,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:33:25,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:33:25,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:33:26,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:33:26,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:33:26,000 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:33:26,001 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:33:26,001 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:33:26,001 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:33:26,001 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:33:26,001 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:33:26,002 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:33:26,002 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:33:26,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:33:26,002 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:33:26,002 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:33:26,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:33:26,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:33:26,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:33:26,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:33:26,006 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:33:26,006 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:33:26,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:33:26,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:33:26,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:33:26,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:33:26,007 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 -> f42cef6ed93900b31f047f50e8a562d6414688ebc2967397026af436d35c76fd [2024-11-08 22:33:26,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:33:26,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:33:26,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:33:26,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:33:26,286 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:33:26,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-1.i [2024-11-08 22:33:27,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:33:27,724 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:33:27,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-1.i [2024-11-08 22:33:27,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dbf618a7/60a102eeb411443fb4da1451f7d75ba5/FLAG998183a00 [2024-11-08 22:33:28,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dbf618a7/60a102eeb411443fb4da1451f7d75ba5 [2024-11-08 22:33:28,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:33:28,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:33:28,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:33:28,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:33:28,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:33:28,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:33:28" (1/1) ... [2024-11-08 22:33:28,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be68423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:28, skipping insertion in model container [2024-11-08 22:33:28,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:33:28" (1/1) ... [2024-11-08 22:33:28,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:33:28,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-1.i[918,931] [2024-11-08 22:33:28,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:33:28,351 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:33:28,360 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-1.i[918,931] [2024-11-08 22:33:28,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:33:28,415 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:33:28,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:28 WrapperNode [2024-11-08 22:33:28,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:33:28,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:33:28,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:33:28,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:33:28,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:28" (1/1) ... [2024-11-08 22:33:28,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:28" (1/1) ... [2024-11-08 22:33:28,471 INFO L138 Inliner]: procedures = 27, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2024-11-08 22:33:28,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:33:28,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:33:28,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:33:28,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:33:28,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:28" (1/1) ... [2024-11-08 22:33:28,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:28" (1/1) ... [2024-11-08 22:33:28,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:28" (1/1) ... [2024-11-08 22:33:28,508 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:33:28,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:28" (1/1) ... [2024-11-08 22:33:28,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:28" (1/1) ... [2024-11-08 22:33:28,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:28" (1/1) ... [2024-11-08 22:33:28,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:28" (1/1) ... [2024-11-08 22:33:28,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:28" (1/1) ... [2024-11-08 22:33:28,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:28" (1/1) ... [2024-11-08 22:33:28,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:33:28,554 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:33:28,554 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:33:28,554 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:33:28,555 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:28" (1/1) ... [2024-11-08 22:33:28,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:33:28,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:33:28,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:33:28,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:33:28,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:33:28,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:33:28,611 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:33:28,611 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:33:28,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:33:28,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:33:28,684 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:33:28,686 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:33:29,057 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 22:33:29,058 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:33:29,072 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:33:29,072 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:33:29,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:33:29 BoogieIcfgContainer [2024-11-08 22:33:29,073 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:33:29,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:33:29,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:33:29,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:33:29,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:33:28" (1/3) ... [2024-11-08 22:33:29,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1057bdc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:33:29, skipping insertion in model container [2024-11-08 22:33:29,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:28" (2/3) ... [2024-11-08 22:33:29,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1057bdc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:33:29, skipping insertion in model container [2024-11-08 22:33:29,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:33:29" (3/3) ... [2024-11-08 22:33:29,081 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-1.i [2024-11-08 22:33:29,095 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:33:29,095 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:33:29,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:33:29,174 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;@5ee0c424, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:33:29,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:33:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 22:33:29,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 22:33:29,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:29,195 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:29,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:29,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:29,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1187459200, now seen corresponding path program 1 times [2024-11-08 22:33:29,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:33:29,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100166898] [2024-11-08 22:33:29,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:29,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:33:29,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:33:29,218 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:33:29,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 22:33:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:29,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:33:29,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:33:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 620 proven. 0 refuted. 0 times theorem prover too weak. 2344 trivial. 0 not checked. [2024-11-08 22:33:29,539 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:33:29,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:33:29,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100166898] [2024-11-08 22:33:29,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100166898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:29,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:29,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:33:29,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137613717] [2024-11-08 22:33:29,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:29,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:33:29,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:33:29,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:33:29,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:33:29,569 INFO L87 Difference]: Start difference. First operand has 104 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-08 22:33:29,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:29,597 INFO L93 Difference]: Finished difference Result 201 states and 365 transitions. [2024-11-08 22:33:29,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:33:29,599 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 242 [2024-11-08 22:33:29,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:29,604 INFO L225 Difference]: With dead ends: 201 [2024-11-08 22:33:29,605 INFO L226 Difference]: Without dead ends: 100 [2024-11-08 22:33:29,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:33:29,610 INFO L432 NwaCegarLoop]: 157 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, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:29,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:33:29,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-08 22:33:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-08 22:33:29,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 59 states have internal predecessors, (79), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 22:33:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 157 transitions. [2024-11-08 22:33:29,652 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 157 transitions. Word has length 242 [2024-11-08 22:33:29,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:29,653 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 157 transitions. [2024-11-08 22:33:29,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-08 22:33:29,653 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 157 transitions. [2024-11-08 22:33:29,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-08 22:33:29,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:29,656 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:29,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 22:33:29,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:33:29,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:29,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:29,859 INFO L85 PathProgramCache]: Analyzing trace with hash -2139455382, now seen corresponding path program 1 times [2024-11-08 22:33:29,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:33:29,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535135584] [2024-11-08 22:33:29,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:29,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:33:29,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:33:29,861 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:33:29,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 22:33:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:30,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 22:33:30,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:33:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 22:33:30,465 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:33:30,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:33:30,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535135584] [2024-11-08 22:33:30,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535135584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:30,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:30,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:33:30,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491691504] [2024-11-08 22:33:30,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:30,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:33:30,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:33:30,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:33:30,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:30,473 INFO L87 Difference]: Start difference. First operand 100 states and 157 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:30,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:30,637 INFO L93 Difference]: Finished difference Result 275 states and 437 transitions. [2024-11-08 22:33:30,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:33:30,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 243 [2024-11-08 22:33:30,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:30,642 INFO L225 Difference]: With dead ends: 275 [2024-11-08 22:33:30,642 INFO L226 Difference]: Without dead ends: 178 [2024-11-08 22:33:30,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:30,645 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 20 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:30,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 271 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:33:30,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-08 22:33:30,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2024-11-08 22:33:30,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 86 states have internal predecessors, (106), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-08 22:33:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 262 transitions. [2024-11-08 22:33:30,679 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 262 transitions. Word has length 243 [2024-11-08 22:33:30,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:30,680 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 262 transitions. [2024-11-08 22:33:30,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:30,680 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 262 transitions. [2024-11-08 22:33:30,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-08 22:33:30,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:30,685 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:30,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 22:33:30,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:33:30,886 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:30,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:30,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1936657196, now seen corresponding path program 1 times [2024-11-08 22:33:30,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:33:30,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716088882] [2024-11-08 22:33:30,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:30,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 22:33:30,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:33:30,891 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:33:30,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 22:33:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:31,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 22:33:31,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:33:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 22:33:31,459 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:33:31,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:33:31,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716088882] [2024-11-08 22:33:31,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716088882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:31,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:31,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:33:31,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439368800] [2024-11-08 22:33:31,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:31,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:33:31,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:33:31,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:33:31,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:31,462 INFO L87 Difference]: Start difference. First operand 167 states and 262 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:31,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:31,534 INFO L93 Difference]: Finished difference Result 359 states and 566 transitions. [2024-11-08 22:33:31,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:33:31,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 243 [2024-11-08 22:33:31,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:31,537 INFO L225 Difference]: With dead ends: 359 [2024-11-08 22:33:31,537 INFO L226 Difference]: Without dead ends: 262 [2024-11-08 22:33:31,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:31,539 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 24 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:31,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 299 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:33:31,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-08 22:33:31,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2024-11-08 22:33:31,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 139 states have (on average 1.2446043165467626) internal successors, (173), 139 states have internal predecessors, (173), 117 states have call successors, (117), 3 states have call predecessors, (117), 3 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-08 22:33:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 407 transitions. [2024-11-08 22:33:31,581 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 407 transitions. Word has length 243 [2024-11-08 22:33:31,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:31,587 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 407 transitions. [2024-11-08 22:33:31,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 407 transitions. [2024-11-08 22:33:31,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 22:33:31,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:31,591 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:31,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 22:33:31,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:33:31,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:31,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:31,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1288431141, now seen corresponding path program 1 times [2024-11-08 22:33:31,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:33:31,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563421507] [2024-11-08 22:33:31,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:31,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:33:31,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:33:31,796 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:33:31,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 22:33:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:31,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 22:33:32,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:33:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 22:33:32,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:33:32,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:33:32,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563421507] [2024-11-08 22:33:32,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563421507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:32,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:32,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:33:32,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327386982] [2024-11-08 22:33:32,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:32,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:33:32,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:33:32,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:33:32,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:32,884 INFO L87 Difference]: Start difference. First operand 260 states and 407 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:33,014 INFO L93 Difference]: Finished difference Result 464 states and 727 transitions. [2024-11-08 22:33:33,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:33:33,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 244 [2024-11-08 22:33:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:33,019 INFO L225 Difference]: With dead ends: 464 [2024-11-08 22:33:33,019 INFO L226 Difference]: Without dead ends: 274 [2024-11-08 22:33:33,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:33,022 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 15 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:33,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 297 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:33:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-08 22:33:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 264. [2024-11-08 22:33:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 143 states have (on average 1.2447552447552448) internal successors, (178), 143 states have internal predecessors, (178), 117 states have call successors, (117), 3 states have call predecessors, (117), 3 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-08 22:33:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 412 transitions. [2024-11-08 22:33:33,057 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 412 transitions. Word has length 244 [2024-11-08 22:33:33,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:33,057 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 412 transitions. [2024-11-08 22:33:33,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 412 transitions. [2024-11-08 22:33:33,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 22:33:33,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:33,061 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:33,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 22:33:33,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:33:33,262 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:33,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:33,262 INFO L85 PathProgramCache]: Analyzing trace with hash -400512601, now seen corresponding path program 1 times [2024-11-08 22:33:33,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:33:33,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712367989] [2024-11-08 22:33:33,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:33,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:33:33,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:33:33,266 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:33:33,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 22:33:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:33,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 22:33:33,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:33:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1151 proven. 48 refuted. 0 times theorem prover too weak. 1765 trivial. 0 not checked. [2024-11-08 22:33:34,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:33:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 174 proven. 51 refuted. 0 times theorem prover too weak. 2739 trivial. 0 not checked. [2024-11-08 22:33:34,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:33:34,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712367989] [2024-11-08 22:33:34,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712367989] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:33:34,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 22:33:34,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2024-11-08 22:33:34,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624929128] [2024-11-08 22:33:34,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 22:33:34,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 22:33:34,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:33:34,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 22:33:34,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2024-11-08 22:33:34,987 INFO L87 Difference]: Start difference. First operand 264 states and 412 transitions. Second operand has 16 states, 15 states have (on average 6.8) internal successors, (102), 14 states have internal predecessors, (102), 6 states have call successors, (78), 4 states have call predecessors, (78), 7 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) [2024-11-08 22:33:36,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:36,014 INFO L93 Difference]: Finished difference Result 483 states and 740 transitions. [2024-11-08 22:33:36,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 22:33:36,015 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.8) internal successors, (102), 14 states have internal predecessors, (102), 6 states have call successors, (78), 4 states have call predecessors, (78), 7 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) Word has length 244 [2024-11-08 22:33:36,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:36,017 INFO L225 Difference]: With dead ends: 483 [2024-11-08 22:33:36,017 INFO L226 Difference]: Without dead ends: 293 [2024-11-08 22:33:36,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2024-11-08 22:33:36,018 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 262 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:36,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 345 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 22:33:36,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-08 22:33:36,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 280. [2024-11-08 22:33:36,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 155 states have (on average 1.2129032258064516) internal successors, (188), 155 states have internal predecessors, (188), 117 states have call successors, (117), 7 states have call predecessors, (117), 7 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-08 22:33:36,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 422 transitions. [2024-11-08 22:33:36,040 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 422 transitions. Word has length 244 [2024-11-08 22:33:36,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:36,041 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 422 transitions. [2024-11-08 22:33:36,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.8) internal successors, (102), 14 states have internal predecessors, (102), 6 states have call successors, (78), 4 states have call predecessors, (78), 7 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) [2024-11-08 22:33:36,041 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 422 transitions. [2024-11-08 22:33:36,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 22:33:36,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:36,043 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:36,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-08 22:33:36,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:33:36,244 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:36,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:36,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1900309989, now seen corresponding path program 1 times [2024-11-08 22:33:36,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:33:36,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934658372] [2024-11-08 22:33:36,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:36,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:33:36,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:33:36,248 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 22:33:36,248 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 22:33:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:36,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 22:33:36,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:33:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1391 proven. 144 refuted. 0 times theorem prover too weak. 1429 trivial. 0 not checked. [2024-11-08 22:33:36,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:33:37,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 22:33:37,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:33:37,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934658372] [2024-11-08 22:33:37,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934658372] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 22:33:37,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 22:33:37,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-11-08 22:33:37,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649912612] [2024-11-08 22:33:37,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:37,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:33:37,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:33:37,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:33:37,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 22:33:37,040 INFO L87 Difference]: Start difference. First operand 280 states and 422 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:37,172 INFO L93 Difference]: Finished difference Result 498 states and 756 transitions. [2024-11-08 22:33:37,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:33:37,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 244 [2024-11-08 22:33:37,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:37,175 INFO L225 Difference]: With dead ends: 498 [2024-11-08 22:33:37,175 INFO L226 Difference]: Without dead ends: 300 [2024-11-08 22:33:37,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 22:33:37,178 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 18 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:37,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 282 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:33:37,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-08 22:33:37,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 280. [2024-11-08 22:33:37,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 155 states have (on average 1.2) internal successors, (186), 155 states have internal predecessors, (186), 117 states have call successors, (117), 7 states have call predecessors, (117), 7 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-08 22:33:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 420 transitions. [2024-11-08 22:33:37,204 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 420 transitions. Word has length 244 [2024-11-08 22:33:37,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:37,205 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 420 transitions. [2024-11-08 22:33:37,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 420 transitions. [2024-11-08 22:33:37,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 22:33:37,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:37,207 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:37,219 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 22:33:37,408 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 22:33:37,408 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:37,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:37,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1693592729, now seen corresponding path program 1 times [2024-11-08 22:33:37,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:33:37,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844889677] [2024-11-08 22:33:37,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:37,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:33:37,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:33:37,411 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 22:33:37,412 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 22:33:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:37,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 22:33:37,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:33:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1364 proven. 75 refuted. 0 times theorem prover too weak. 1525 trivial. 0 not checked. [2024-11-08 22:33:37,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:33:37,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:33:37,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844889677] [2024-11-08 22:33:37,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844889677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:33:37,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [813468597] [2024-11-08 22:33:37,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:37,876 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 22:33:37,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 22:33:37,878 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 22:33:37,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-08 22:33:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:38,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 22:33:38,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:33:38,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 22:33:38,476 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:33:38,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [813468597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:38,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 22:33:38,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-11-08 22:33:38,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066618393] [2024-11-08 22:33:38,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:38,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:33:38,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:33:38,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:33:38,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 22:33:38,478 INFO L87 Difference]: Start difference. First operand 280 states and 420 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:38,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:38,889 INFO L93 Difference]: Finished difference Result 580 states and 860 transitions. [2024-11-08 22:33:38,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:33:38,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 244 [2024-11-08 22:33:38,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:38,892 INFO L225 Difference]: With dead ends: 580 [2024-11-08 22:33:38,892 INFO L226 Difference]: Without dead ends: 382 [2024-11-08 22:33:38,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-08 22:33:38,893 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 162 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:38,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 459 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 22:33:38,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-08 22:33:38,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 302. [2024-11-08 22:33:38,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 175 states have (on average 1.2) internal successors, (210), 175 states have internal predecessors, (210), 117 states have call successors, (117), 9 states have call predecessors, (117), 9 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-08 22:33:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 444 transitions. [2024-11-08 22:33:38,911 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 444 transitions. Word has length 244 [2024-11-08 22:33:38,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:38,912 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 444 transitions. [2024-11-08 22:33:38,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 22:33:38,912 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 444 transitions. [2024-11-08 22:33:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 22:33:38,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:38,917 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:38,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-11-08 22:33:39,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-08 22:33:39,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:33:39,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:39,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:39,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1695978086, now seen corresponding path program 1 times [2024-11-08 22:33:39,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:33:39,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851311641] [2024-11-08 22:33:39,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:39,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:33:39,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:33:39,325 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:33:39,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-08 22:33:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:39,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 22:33:39,510 INFO L278 TraceCheckSpWp]: Computing forward predicates...