./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.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 8920271114188d3ea569925fb7a99f78f49c1ab5edfd793b8aed7395cbd29159 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:06:45,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:06:46,054 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:06:46,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:06:46,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:06:46,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:06:46,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:06:46,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:06:46,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:06:46,088 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:06:46,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:06:46,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:06:46,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:06:46,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:06:46,090 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:06:46,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:06:46,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:06:46,091 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:06:46,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:06:46,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:06:46,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:06:46,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:06:46,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:06:46,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:06:46,094 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:06:46,095 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:06:46,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:06:46,096 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:06:46,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:06:46,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:06:46,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:06:46,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:06:46,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:06:46,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:06:46,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:06:46,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:06:46,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:06:46,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:06:46,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:06:46,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:06:46,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:06:46,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:06:46,101 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 -> 8920271114188d3ea569925fb7a99f78f49c1ab5edfd793b8aed7395cbd29159 [2024-11-20 05:06:46,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:06:46,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:06:46,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:06:46,423 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:06:46,424 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:06:46,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i [2024-11-20 05:06:48,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:06:48,312 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:06:48,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i [2024-11-20 05:06:48,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb34f7df3/519697026a4d4994ab7b77614df7599b/FLAG9bd63115f [2024-11-20 05:06:48,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb34f7df3/519697026a4d4994ab7b77614df7599b [2024-11-20 05:06:48,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:06:48,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:06:48,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:06:48,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:06:48,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:06:48,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:06:48" (1/1) ... [2024-11-20 05:06:48,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b95a57c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:06:48, skipping insertion in model container [2024-11-20 05:06:48,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:06:48" (1/1) ... [2024-11-20 05:06:48,392 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:06:48,585 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i[919,932] [2024-11-20 05:06:48,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:06:48,680 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:06:48,691 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i[919,932] [2024-11-20 05:06:48,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:06:48,765 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:06:48,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:06:48 WrapperNode [2024-11-20 05:06:48,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:06:48,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:06:48,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:06:48,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:06:48,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:06:48" (1/1) ... [2024-11-20 05:06:48,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:06:48" (1/1) ... [2024-11-20 05:06:48,827 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-11-20 05:06:48,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:06:48,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:06:48,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:06:48,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:06:48,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:06:48" (1/1) ... [2024-11-20 05:06:48,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:06:48" (1/1) ... [2024-11-20 05:06:48,860 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:06:48" (1/1) ... [2024-11-20 05:06:48,901 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-20 05:06:48,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:06:48" (1/1) ... [2024-11-20 05:06:48,902 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:06:48" (1/1) ... [2024-11-20 05:06:48,915 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:06:48" (1/1) ... [2024-11-20 05:06:48,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:06:48" (1/1) ... [2024-11-20 05:06:48,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:06:48" (1/1) ... [2024-11-20 05:06:48,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:06:48" (1/1) ... [2024-11-20 05:06:48,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:06:48,939 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:06:48,940 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:06:48,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:06:48,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:06:48" (1/1) ... [2024-11-20 05:06:48,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:06:48,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:06:49,000 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-20 05:06:49,013 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-20 05:06:49,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:06:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:06:49,068 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:06:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:06:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:06:49,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:06:49,169 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:06:49,174 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:06:49,570 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 05:06:49,571 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:06:49,587 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:06:49,588 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:06:49,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:06:49 BoogieIcfgContainer [2024-11-20 05:06:49,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:06:49,592 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:06:49,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:06:49,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:06:49,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:06:48" (1/3) ... [2024-11-20 05:06:49,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121dd177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:06:49, skipping insertion in model container [2024-11-20 05:06:49,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:06:48" (2/3) ... [2024-11-20 05:06:49,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121dd177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:06:49, skipping insertion in model container [2024-11-20 05:06:49,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:06:49" (3/3) ... [2024-11-20 05:06:49,603 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i [2024-11-20 05:06:49,623 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:06:49,623 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:06:49,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:06:49,713 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;@7ce859ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:06:49,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:06:49,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 58 states have internal predecessors, (85), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 05:06:49,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 05:06:49,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:06:49,733 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:06:49,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:06:49,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:06:49,738 INFO L85 PathProgramCache]: Analyzing trace with hash -433352133, now seen corresponding path program 1 times [2024-11-20 05:06:49,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:06:49,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926934379] [2024-11-20 05:06:49,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:06:49,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:06:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:06:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:06:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:06:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:06:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:06:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:06:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:06:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:06:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:06:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:06:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:06:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:06:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:06:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:06:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:06:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:06:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:06:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:06:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 05:06:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 05:06:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 05:06:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 05:06:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 05:06:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 05:06:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 05:06:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 05:06:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 05:06:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 05:06:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 05:06:50,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:06:50,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926934379] [2024-11-20 05:06:50,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926934379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:06:50,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:06:50,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:06:50,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241793999] [2024-11-20 05:06:50,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:06:50,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:06:50,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:06:50,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:06:50,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:06:50,394 INFO L87 Difference]: Start difference. First operand has 88 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 58 states have internal predecessors, (85), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 05:06:50,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:06:50,457 INFO L93 Difference]: Finished difference Result 167 states and 301 transitions. [2024-11-20 05:06:50,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:06:50,482 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 177 [2024-11-20 05:06:50,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:06:50,495 INFO L225 Difference]: With dead ends: 167 [2024-11-20 05:06:50,496 INFO L226 Difference]: Without dead ends: 82 [2024-11-20 05:06:50,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-20 05:06:50,507 INFO L432 NwaCegarLoop]: 130 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, 130 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-20 05:06:50,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:06:50,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-20 05:06:50,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-20 05:06:50,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 05:06:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 130 transitions. [2024-11-20 05:06:50,560 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 130 transitions. Word has length 177 [2024-11-20 05:06:50,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:06:50,562 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 130 transitions. [2024-11-20 05:06:50,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 05:06:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 130 transitions. [2024-11-20 05:06:50,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 05:06:50,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:06:50,569 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:06:50,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:06:50,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:06:50,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:06:50,571 INFO L85 PathProgramCache]: Analyzing trace with hash 790678911, now seen corresponding path program 1 times [2024-11-20 05:06:50,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:06:50,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440408925] [2024-11-20 05:06:50,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:06:50,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:06:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:06:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:06:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:06:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:06:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:06:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:06:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:06:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:06:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:06:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:06:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:06:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:06:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:06:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:06:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:06:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:06:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:06:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:06:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 05:06:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 05:06:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 05:06:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 05:06:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 05:06:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 05:06:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 05:06:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 05:06:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 05:06:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 05:06:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 05:06:50,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:06:50,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440408925] [2024-11-20 05:06:50,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440408925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:06:50,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:06:50,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:06:50,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771745533] [2024-11-20 05:06:50,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:06:50,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:06:50,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:06:50,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:06:50,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:06:50,994 INFO L87 Difference]: Start difference. First operand 82 states and 130 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 05:06:51,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:06:51,084 INFO L93 Difference]: Finished difference Result 196 states and 310 transitions. [2024-11-20 05:06:51,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:06:51,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-11-20 05:06:51,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:06:51,088 INFO L225 Difference]: With dead ends: 196 [2024-11-20 05:06:51,088 INFO L226 Difference]: Without dead ends: 117 [2024-11-20 05:06:51,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-20 05:06:51,090 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 47 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:06:51,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 272 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:06:51,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-20 05:06:51,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2024-11-20 05:06:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 82 states have internal predecessors, (118), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 05:06:51,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 178 transitions. [2024-11-20 05:06:51,109 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 178 transitions. Word has length 177 [2024-11-20 05:06:51,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:06:51,110 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 178 transitions. [2024-11-20 05:06:51,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 05:06:51,110 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 178 transitions. [2024-11-20 05:06:51,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-20 05:06:51,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:06:51,113 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:06:51,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:06:51,114 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:06:51,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:06:51,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1541253744, now seen corresponding path program 1 times [2024-11-20 05:06:51,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:06:51,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977693790] [2024-11-20 05:06:51,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:06:51,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:06:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:06:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:06:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:06:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:06:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:06:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:06:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:06:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:06:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:06:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:06:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:06:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:06:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:06:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:06:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:06:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:06:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:06:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:06:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 05:06:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 05:06:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 05:06:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 05:06:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 05:06:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 05:06:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 05:06:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 05:06:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 05:06:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 05:06:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 05:06:51,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:06:51,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977693790] [2024-11-20 05:06:51,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977693790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:06:51,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:06:51,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:06:51,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547621000] [2024-11-20 05:06:51,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:06:51,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:06:51,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:06:51,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:06:51,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:06:51,662 INFO L87 Difference]: Start difference. First operand 114 states and 178 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 05:06:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:06:51,738 INFO L93 Difference]: Finished difference Result 309 states and 492 transitions. [2024-11-20 05:06:51,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:06:51,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2024-11-20 05:06:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:06:51,750 INFO L225 Difference]: With dead ends: 309 [2024-11-20 05:06:51,750 INFO L226 Difference]: Without dead ends: 198 [2024-11-20 05:06:51,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-20 05:06:51,756 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 59 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:06:51,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 245 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:06:51,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-20 05:06:51,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 174. [2024-11-20 05:06:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 113 states have internal predecessors, (156), 58 states have call successors, (58), 3 states have call predecessors, (58), 3 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-20 05:06:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 272 transitions. [2024-11-20 05:06:51,811 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 272 transitions. Word has length 178 [2024-11-20 05:06:51,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:06:51,812 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 272 transitions. [2024-11-20 05:06:51,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 05:06:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 272 transitions. [2024-11-20 05:06:51,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-20 05:06:51,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:06:51,817 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:06:51,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 05:06:51,818 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:06:51,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:06:51,819 INFO L85 PathProgramCache]: Analyzing trace with hash -692858858, now seen corresponding path program 1 times [2024-11-20 05:06:51,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:06:51,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125954867] [2024-11-20 05:06:51,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:06:51,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:06:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:06:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:06:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:06:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:06:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:06:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:06:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:06:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:06:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:06:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:06:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:06:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:06:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:06:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:06:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:06:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:06:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:06:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:06:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 05:06:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 05:06:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 05:06:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 05:06:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 05:06:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 05:06:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 05:06:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 05:06:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 05:06:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 05:06:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 05:06:52,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:06:52,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125954867] [2024-11-20 05:06:52,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125954867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:06:52,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:06:52,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:06:52,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989774665] [2024-11-20 05:06:52,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:06:52,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:06:52,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:06:52,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:06:52,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:06:52,267 INFO L87 Difference]: Start difference. First operand 174 states and 272 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 05:06:52,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:06:52,319 INFO L93 Difference]: Finished difference Result 396 states and 622 transitions. [2024-11-20 05:06:52,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:06:52,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2024-11-20 05:06:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:06:52,331 INFO L225 Difference]: With dead ends: 396 [2024-11-20 05:06:52,331 INFO L226 Difference]: Without dead ends: 285 [2024-11-20 05:06:52,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-20 05:06:52,337 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 68 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:06:52,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 251 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:06:52,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-20 05:06:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2024-11-20 05:06:52,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 189 states have (on average 1.417989417989418) internal successors, (268), 191 states have internal predecessors, (268), 88 states have call successors, (88), 5 states have call predecessors, (88), 5 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-20 05:06:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 444 transitions. [2024-11-20 05:06:52,400 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 444 transitions. Word has length 178 [2024-11-20 05:06:52,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:06:52,401 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 444 transitions. [2024-11-20 05:06:52,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 05:06:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 444 transitions. [2024-11-20 05:06:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-20 05:06:52,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:06:52,404 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:06:52,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 05:06:52,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:06:52,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:06:52,405 INFO L85 PathProgramCache]: Analyzing trace with hash -635600556, now seen corresponding path program 1 times [2024-11-20 05:06:52,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:06:52,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906468024] [2024-11-20 05:06:52,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:06:52,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:06:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:06:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:06:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:06:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:06:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:06:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:06:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:06:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:06:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:06:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:06:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:06:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:06:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:06:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:06:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:06:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:06:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:06:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:06:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 05:06:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 05:06:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 05:06:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 05:06:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 05:06:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 05:06:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 05:06:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 05:06:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 05:06:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 05:06:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 05:06:52,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:06:52,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906468024] [2024-11-20 05:06:52,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906468024] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 05:06:52,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242204425] [2024-11-20 05:06:52,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:06:52,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:06:52,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:06:52,925 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-20 05:06:52,926 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-20 05:06:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:06:53,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 05:06:53,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:06:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 929 proven. 12 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2024-11-20 05:06:53,484 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:06:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 05:06:53,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242204425] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 05:06:53,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 05:06:53,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-20 05:06:53,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439914858] [2024-11-20 05:06:53,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 05:06:53,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 05:06:53,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:06:53,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 05:06:53,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-20 05:06:53,787 INFO L87 Difference]: Start difference. First operand 283 states and 444 transitions. Second operand has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 6 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 6 states have call successors, (68) [2024-11-20 05:06:54,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:06:54,134 INFO L93 Difference]: Finished difference Result 525 states and 810 transitions. [2024-11-20 05:06:54,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 05:06:54,135 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 6 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 6 states have call successors, (68) Word has length 178 [2024-11-20 05:06:54,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:06:54,139 INFO L225 Difference]: With dead ends: 525 [2024-11-20 05:06:54,139 INFO L226 Difference]: Without dead ends: 305 [2024-11-20 05:06:54,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2024-11-20 05:06:54,141 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 134 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 05:06:54,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 321 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 05:06:54,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-20 05:06:54,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 295. [2024-11-20 05:06:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 198 states have (on average 1.378787878787879) internal successors, (273), 200 states have internal predecessors, (273), 88 states have call successors, (88), 8 states have call predecessors, (88), 8 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-20 05:06:54,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 449 transitions. [2024-11-20 05:06:54,176 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 449 transitions. Word has length 178 [2024-11-20 05:06:54,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:06:54,177 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 449 transitions. [2024-11-20 05:06:54,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 6 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 6 states have call successors, (68) [2024-11-20 05:06:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 449 transitions. [2024-11-20 05:06:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 05:06:54,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:06:54,180 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:06:54,190 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-20 05:06:54,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:06:54,381 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:06:54,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:06:54,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1436762949, now seen corresponding path program 1 times [2024-11-20 05:06:54,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:06:54,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135205281] [2024-11-20 05:06:54,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:06:54,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:06:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 05:06:54,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1681112014] [2024-11-20 05:06:54,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:06:54,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:06:54,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:06:54,520 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-20 05:06:54,526 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-20 05:06:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:06:54,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 05:06:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:06:54,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 05:06:54,890 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 05:06:54,892 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 05:06:54,904 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-20 05:06:55,094 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,SelfDestructingSolverStorable5 [2024-11-20 05:06:55,098 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-20 05:06:55,240 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 05:06:55,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:06:55 BoogieIcfgContainer [2024-11-20 05:06:55,243 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 05:06:55,244 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 05:06:55,244 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 05:06:55,244 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 05:06:55,244 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:06:49" (3/4) ... [2024-11-20 05:06:55,247 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 05:06:55,249 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 05:06:55,249 INFO L158 Benchmark]: Toolchain (without parser) took 6902.79ms. Allocated memory was 151.0MB in the beginning and 255.9MB in the end (delta: 104.9MB). Free memory was 80.6MB in the beginning and 150.2MB in the end (delta: -69.5MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2024-11-20 05:06:55,249 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 151.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:06:55,250 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.92ms. Allocated memory is still 151.0MB. Free memory was 80.4MB in the beginning and 64.0MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 05:06:55,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.24ms. Allocated memory is still 151.0MB. Free memory was 63.9MB in the beginning and 61.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 05:06:55,250 INFO L158 Benchmark]: Boogie Preprocessor took 108.57ms. Allocated memory is still 151.0MB. Free memory was 61.0MB in the beginning and 119.3MB in the end (delta: -58.3MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-11-20 05:06:55,250 INFO L158 Benchmark]: RCFGBuilder took 649.87ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 119.2MB in the beginning and 157.9MB in the end (delta: -38.7MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2024-11-20 05:06:55,251 INFO L158 Benchmark]: TraceAbstraction took 5650.72ms. Allocated memory was 211.8MB in the beginning and 255.9MB in the end (delta: 44.0MB). Free memory was 157.9MB in the beginning and 151.2MB in the end (delta: 6.7MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2024-11-20 05:06:55,251 INFO L158 Benchmark]: Witness Printer took 5.09ms. Allocated memory is still 255.9MB. Free memory was 151.2MB in the beginning and 150.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 05:06:55,254 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.20ms. Allocated memory is still 151.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.92ms. Allocated memory is still 151.0MB. Free memory was 80.4MB in the beginning and 64.0MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.24ms. Allocated memory is still 151.0MB. Free memory was 63.9MB in the beginning and 61.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.57ms. Allocated memory is still 151.0MB. Free memory was 61.0MB in the beginning and 119.3MB in the end (delta: -58.3MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * RCFGBuilder took 649.87ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 119.2MB in the beginning and 157.9MB in the end (delta: -38.7MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5650.72ms. Allocated memory was 211.8MB in the beginning and 255.9MB in the end (delta: 44.0MB). Free memory was 157.9MB in the beginning and 151.2MB in the end (delta: 6.7MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. * Witness Printer took 5.09ms. Allocated memory is still 255.9MB. Free memory was 151.2MB in the beginning and 150.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryArithmeticFLOAToperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 0; [L26] signed short int var_1_9 = 0; [L27] signed short int var_1_10 = 8; [L28] signed char var_1_11 = 1; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = -2; [L31] signed char var_1_14 = 8; [L32] signed char var_1_15 = 0; [L33] signed char var_1_16 = 10; [L34] signed char var_1_17 = 32; [L35] unsigned char var_1_18 = 0; [L36] signed char var_1_19 = -1; [L37] signed short int var_1_20 = 100; [L38] signed short int var_1_22 = 29265; [L39] float var_1_23 = 31.6; [L40] float var_1_24 = 9.2; [L41] float var_1_25 = 15.6; [L42] float var_1_26 = 25.25; [L43] unsigned long int var_1_27 = 256; [L44] double var_1_29 = 15.86; [L45] signed short int var_1_31 = 10; [L46] float var_1_39 = 4.7; [L47] unsigned short int var_1_40 = 100; [L48] signed short int var_1_41 = 4; [L49] float var_1_45 = 31.6; [L50] unsigned short int var_1_47 = 64; [L51] double var_1_48 = 16.75; VAL [isInitial=0, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] FCALL updateLastVariables() [L193] CALL updateVariables() [L138] var_1_6 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_7=0, var_1_8=0, var_1_9=0] [L139] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_7=0, var_1_8=0, var_1_9=0] [L140] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L140] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L141] var_1_7 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L142] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L143] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L143] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L144] var_1_9 = __VERIFIER_nondet_short() [L145] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L145] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L146] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L146] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L147] var_1_10 = __VERIFIER_nondet_short() [L148] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L148] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L149] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L149] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L150] var_1_12 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L151] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L152] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L152] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L153] var_1_13 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L154] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L155] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L155] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L156] var_1_14 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L157] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L158] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L158] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L159] var_1_15 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L160] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L161] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L161] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L162] var_1_16 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L163] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L164] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L164] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L165] var_1_17 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L166] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L167] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L167] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L168] var_1_19 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L169] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L170] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L170] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L171] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L171] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L172] var_1_22 = __VERIFIER_nondet_short() [L173] CALL assume_abort_if_not(var_1_22 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L173] RET assume_abort_if_not(var_1_22 >= 16382) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L174] CALL assume_abort_if_not(var_1_22 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L174] RET assume_abort_if_not(var_1_22 <= 32766) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L175] var_1_24 = __VERIFIER_nondet_float() [L176] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L176] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L177] var_1_25 = __VERIFIER_nondet_float() [L178] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L178] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L179] var_1_26 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L180] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L193] RET updateVariables() [L194] CALL step() [L55] var_1_29 = var_1_26 VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=2, var_1_27=256, var_1_29=2, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L56] COND TRUE var_1_7 && var_1_7 [L57] var_1_31 = ((((((((var_1_15 - var_1_10)) > (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) ? ((var_1_15 - var_1_10)) : (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) < 0 ) ? -(((((var_1_15 - var_1_10)) > (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) ? ((var_1_15 - var_1_10)) : (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) : (((((var_1_15 - var_1_10)) > (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) ? ((var_1_15 - var_1_10)) : (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))))) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=2, var_1_27=256, var_1_29=2, var_1_31=65, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L67] COND FALSE !(var_1_23 < var_1_24) [L72] var_1_39 = 15.6f VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=2, var_1_27=256, var_1_29=2, var_1_31=65, var_1_39=78/5, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L74] var_1_40 = var_1_15 VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=2, var_1_27=256, var_1_29=2, var_1_31=65, var_1_39=78/5, var_1_40=63, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L75] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=2, var_1_27=256, var_1_29=2, var_1_31=65, var_1_39=78/5, var_1_40=63, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L82] EXPR var_1_15 | var_1_15 VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=2, var_1_27=256, var_1_29=2, var_1_31=65, var_1_39=78/5, var_1_40=63, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L82] COND FALSE !(var_1_10 > (var_1_15 | var_1_15)) [L89] var_1_41 = var_1_15 VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=2, var_1_27=256, var_1_29=2, var_1_31=65, var_1_39=78/5, var_1_40=63, var_1_41=63, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L92] COND TRUE var_1_1 || var_1_7 [L93] var_1_45 = (10.125f + var_1_24) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=2, var_1_27=256, var_1_29=2, var_1_31=65, var_1_39=78/5, var_1_40=63, var_1_41=63, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L95] var_1_47 = var_1_15 [L96] var_1_48 = var_1_25 [L97] var_1_8 = (var_1_9 - (2 + var_1_10)) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=3, var_1_26=2, var_1_27=256, var_1_29=2, var_1_31=65, var_1_39=78/5, var_1_40=63, var_1_41=63, var_1_47=63, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L98] COND TRUE var_1_22 != var_1_12 VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=3, var_1_26=2, var_1_27=256, var_1_29=2, var_1_31=65, var_1_39=78/5, var_1_40=63, var_1_41=63, var_1_47=63, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L99] COND FALSE !(var_1_10 <= var_1_17) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=3, var_1_26=2, var_1_27=256, var_1_29=2, var_1_31=65, var_1_39=78/5, var_1_40=63, var_1_41=63, var_1_47=63, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L105] COND TRUE ! ((var_1_9 - var_1_22) > var_1_12) [L106] var_1_27 = var_1_15 VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=3, var_1_26=2, var_1_27=63, var_1_29=2, var_1_31=65, var_1_39=78/5, var_1_40=63, var_1_41=63, var_1_47=63, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L108] COND FALSE !(var_1_23 == var_1_23) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=3, var_1_26=2, var_1_27=63, var_1_29=2, var_1_31=65, var_1_39=78/5, var_1_40=63, var_1_41=63, var_1_47=63, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L113] COND TRUE (- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23) [L114] var_1_20 = ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10) VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=16256, var_1_22=16382, var_1_23=158/5, var_1_25=3, var_1_26=2, var_1_27=63, var_1_29=2, var_1_31=65, var_1_39=78/5, var_1_40=63, var_1_41=63, var_1_47=63, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L118] COND FALSE !(\read(var_1_18)) [L121] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=63, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=1, var_1_20=16256, var_1_22=16382, var_1_23=158/5, var_1_25=3, var_1_26=2, var_1_27=63, var_1_29=2, var_1_31=65, var_1_39=78/5, var_1_40=63, var_1_41=63, var_1_47=63, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L123] COND TRUE \read(var_1_1) [L124] var_1_11 = (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) VAL [isInitial=1, var_1_10=63, var_1_11=126, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=1, var_1_20=16256, var_1_22=16382, var_1_23=158/5, var_1_25=3, var_1_26=2, var_1_27=63, var_1_29=2, var_1_31=65, var_1_39=78/5, var_1_40=63, var_1_41=63, var_1_47=63, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L194] RET step() [L195] CALL, EXPR property() [L185-L186] return ((((((var_1_18 ? (var_1_1 == ((unsigned char) (((-128 <= var_1_20) || (var_1_23 >= var_1_23)) && var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) && (var_1_8 == ((signed short int) (var_1_9 - (2 + var_1_10))))) && (var_1_1 ? (var_1_11 == ((signed char) (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) : ((var_1_27 >= var_1_14) ? (var_1_11 == ((signed char) ((var_1_15 + var_1_16) - var_1_17))) : (var_1_7 ? (var_1_11 == ((signed char) var_1_16)) : (var_1_11 == ((signed char) var_1_12)))))) && ((var_1_23 == var_1_23) ? ((var_1_15 >= (var_1_27 / var_1_19)) ? (var_1_18 == ((unsigned char) var_1_7)) : 1) : 1)) && (((- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23)) ? (var_1_20 == ((signed short int) ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10))) : (var_1_20 == ((signed short int) var_1_19)))) && ((var_1_22 != var_1_12) ? ((var_1_10 <= var_1_17) ? (var_1_23 == ((float) (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))) : 1) : (var_1_23 == ((float) var_1_25)))) && ((! ((var_1_9 - var_1_22) > var_1_12)) ? (var_1_27 == ((unsigned long int) var_1_15)) : 1) ; VAL [\result=0, isInitial=1, var_1_10=63, var_1_11=126, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=1, var_1_20=16256, var_1_22=16382, var_1_23=158/5, var_1_25=3, var_1_26=2, var_1_27=63, var_1_29=2, var_1_31=65, var_1_39=78/5, var_1_40=63, var_1_41=63, var_1_47=63, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=63, var_1_11=126, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=1, var_1_20=16256, var_1_22=16382, var_1_23=158/5, var_1_25=3, var_1_26=2, var_1_27=63, var_1_29=2, var_1_31=65, var_1_39=78/5, var_1_40=63, var_1_41=63, var_1_47=63, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] [L19] reach_error() VAL [isInitial=1, var_1_10=63, var_1_11=126, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=62, var_1_18=0, var_1_19=64, var_1_1=1, var_1_20=16256, var_1_22=16382, var_1_23=158/5, var_1_25=3, var_1_26=2, var_1_27=63, var_1_29=2, var_1_31=65, var_1_39=78/5, var_1_40=63, var_1_41=63, var_1_47=63, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=65] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 6, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 308 mSDsluCounter, 1219 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 585 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 358 IncrementalHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 634 mSDtfsCounter, 358 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 681 GetRequests, 664 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=5, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 39 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1424 NumberOfCodeBlocks, 1424 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1237 ConstructedInterpolants, 0 QuantifiedInterpolants, 2102 SizeOfPredicates, 3 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 10548/10584 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-20 05:06:55,280 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.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 8920271114188d3ea569925fb7a99f78f49c1ab5edfd793b8aed7395cbd29159 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:06:57,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:06:57,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 05:06:57,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:06:57,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:06:57,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:06:57,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:06:57,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:06:57,804 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:06:57,805 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:06:57,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:06:57,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:06:57,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:06:57,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:06:57,808 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:06:57,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:06:57,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:06:57,812 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:06:57,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:06:57,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:06:57,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:06:57,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:06:57,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:06:57,814 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 05:06:57,814 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 05:06:57,814 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:06:57,815 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 05:06:57,815 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:06:57,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:06:57,816 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:06:57,816 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:06:57,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:06:57,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:06:57,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:06:57,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:06:57,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:06:57,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:06:57,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:06:57,820 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 05:06:57,821 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 05:06:57,821 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:06:57,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:06:57,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:06:57,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:06:57,822 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 -> 8920271114188d3ea569925fb7a99f78f49c1ab5edfd793b8aed7395cbd29159 [2024-11-20 05:06:58,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:06:58,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:06:58,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:06:58,259 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:06:58,260 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:06:58,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i [2024-11-20 05:06:59,961 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:07:00,215 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:07:00,216 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i [2024-11-20 05:07:00,231 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71018f8bc/9f5ce6b957f74273ad864ecf20c845e9/FLAG91c79ddff [2024-11-20 05:07:00,247 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71018f8bc/9f5ce6b957f74273ad864ecf20c845e9 [2024-11-20 05:07:00,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:07:00,250 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:07:00,253 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:07:00,253 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:07:00,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:07:00,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:07:00" (1/1) ... [2024-11-20 05:07:00,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73606ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:07:00, skipping insertion in model container [2024-11-20 05:07:00,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:07:00" (1/1) ... [2024-11-20 05:07:00,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:07:00,530 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i[919,932] [2024-11-20 05:07:00,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:07:00,657 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:07:00,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i[919,932] [2024-11-20 05:07:00,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:07:00,742 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:07:00,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:07:00 WrapperNode [2024-11-20 05:07:00,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:07:00,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:07:00,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:07:00,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:07:00,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:07:00" (1/1) ... [2024-11-20 05:07:00,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:07:00" (1/1) ... [2024-11-20 05:07:00,814 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-11-20 05:07:00,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:07:00,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:07:00,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:07:00,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:07:00,834 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:07:00" (1/1) ... [2024-11-20 05:07:00,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:07:00" (1/1) ... [2024-11-20 05:07:00,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:07:00" (1/1) ... [2024-11-20 05:07:00,863 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-20 05:07:00,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:07:00" (1/1) ... [2024-11-20 05:07:00,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:07:00" (1/1) ... [2024-11-20 05:07:00,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:07:00" (1/1) ... [2024-11-20 05:07:00,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:07:00" (1/1) ... [2024-11-20 05:07:00,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:07:00" (1/1) ... [2024-11-20 05:07:00,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:07:00" (1/1) ... [2024-11-20 05:07:00,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:07:00,909 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:07:00,910 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:07:00,910 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:07:00,911 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:07:00" (1/1) ... [2024-11-20 05:07:00,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:07:00,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:07:00,950 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-20 05:07:00,957 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-20 05:07:01,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:07:01,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 05:07:01,007 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:07:01,007 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:07:01,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:07:01,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:07:01,115 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:07:01,117 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:07:03,267 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 05:07:03,268 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:07:03,281 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:07:03,282 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:07:03,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:07:03 BoogieIcfgContainer [2024-11-20 05:07:03,282 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:07:03,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:07:03,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:07:03,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:07:03,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:07:00" (1/3) ... [2024-11-20 05:07:03,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be94d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:07:03, skipping insertion in model container [2024-11-20 05:07:03,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:07:00" (2/3) ... [2024-11-20 05:07:03,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be94d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:07:03, skipping insertion in model container [2024-11-20 05:07:03,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:07:03" (3/3) ... [2024-11-20 05:07:03,292 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-29.i [2024-11-20 05:07:03,309 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:07:03,309 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:07:03,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:07:03,402 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;@27afd0eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:07:03,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:07:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 05:07:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 05:07:03,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:07:03,426 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:07:03,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:07:03,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:07:03,432 INFO L85 PathProgramCache]: Analyzing trace with hash -280986139, now seen corresponding path program 1 times [2024-11-20 05:07:03,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:07:03,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564000659] [2024-11-20 05:07:03,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:07:03,449 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-20 05:07:03,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:07:03,453 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-20 05:07:03,455 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-20 05:07:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:07:03,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 05:07:03,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:07:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-20 05:07:03,975 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:07:03,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:07:03,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564000659] [2024-11-20 05:07:03,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564000659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:07:03,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:07:03,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:07:03,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780678421] [2024-11-20 05:07:03,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:07:03,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:07:03,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:07:04,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:07:04,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:07:04,024 INFO L87 Difference]: Start difference. First operand has 85 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 05:07:04,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:07:04,066 INFO L93 Difference]: Finished difference Result 163 states and 294 transitions. [2024-11-20 05:07:04,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:07:04,068 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 177 [2024-11-20 05:07:04,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:07:04,080 INFO L225 Difference]: With dead ends: 163 [2024-11-20 05:07:04,080 INFO L226 Difference]: Without dead ends: 81 [2024-11-20 05:07:04,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 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-20 05:07:04,090 INFO L432 NwaCegarLoop]: 128 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, 128 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-20 05:07:04,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:07:04,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-20 05:07:04,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-20 05:07:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 05:07:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 128 transitions. [2024-11-20 05:07:04,153 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 128 transitions. Word has length 177 [2024-11-20 05:07:04,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:07:04,154 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 128 transitions. [2024-11-20 05:07:04,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 05:07:04,155 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 128 transitions. [2024-11-20 05:07:04,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 05:07:04,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:07:04,161 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:07:04,179 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-20 05:07:04,362 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-20 05:07:04,362 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:07:04,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:07:04,363 INFO L85 PathProgramCache]: Analyzing trace with hash 943044905, now seen corresponding path program 1 times [2024-11-20 05:07:04,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:07:04,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710386263] [2024-11-20 05:07:04,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:07:04,365 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-20 05:07:04,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:07:04,369 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-20 05:07:04,370 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-20 05:07:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:07:04,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 05:07:04,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:07:05,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-20 05:07:05,034 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:07:05,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:07:05,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710386263] [2024-11-20 05:07:05,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1710386263] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 05:07:05,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [221734112] [2024-11-20 05:07:05,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:07:05,146 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 05:07:05,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 05:07:05,149 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 05:07:05,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-20 05:07:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:07:05,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 05:07:05,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:07:06,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 05:07:06,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:07:06,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [221734112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:07:06,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 05:07:06,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-20 05:07:06,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881333400] [2024-11-20 05:07:06,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:07:06,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:07:06,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:07:06,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:07:06,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:07:06,204 INFO L87 Difference]: Start difference. First operand 81 states and 128 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 05:07:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:07:06,865 INFO L93 Difference]: Finished difference Result 237 states and 378 transitions. [2024-11-20 05:07:06,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:07:06,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-11-20 05:07:06,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:07:06,898 INFO L225 Difference]: With dead ends: 237 [2024-11-20 05:07:06,898 INFO L226 Difference]: Without dead ends: 159 [2024-11-20 05:07:06,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:07:06,900 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 36 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 05:07:06,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 247 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 05:07:06,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-20 05:07:06,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2024-11-20 05:07:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 98 states have internal predecessors, (139), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 05:07:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 251 transitions. [2024-11-20 05:07:06,935 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 251 transitions. Word has length 177 [2024-11-20 05:07:06,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:07:06,936 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 251 transitions. [2024-11-20 05:07:06,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 05:07:06,936 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 251 transitions. [2024-11-20 05:07:06,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 05:07:06,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:07:06,939 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:07:06,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-20 05:07:07,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 05:07:07,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-20 05:07:07,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:07:07,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:07:07,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1000303207, now seen corresponding path program 1 times [2024-11-20 05:07:07,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:07:07,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265505754] [2024-11-20 05:07:07,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:07:07,343 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-20 05:07:07,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:07:07,346 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-20 05:07:07,346 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-20 05:07:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:07:07,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 05:07:07,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:07:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-20 05:07:07,978 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:07:08,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:07:08,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265505754] [2024-11-20 05:07:08,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1265505754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 05:07:08,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [920185934] [2024-11-20 05:07:08,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:07:08,115 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 05:07:08,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 05:07:08,118 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 05:07:08,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-20 05:07:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:07:09,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 05:07:09,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:07:10,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 183 proven. 3 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-20 05:07:10,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:07:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 05:07:11,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [920185934] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 05:07:11,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 05:07:11,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2024-11-20 05:07:11,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312956137] [2024-11-20 05:07:11,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 05:07:11,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 05:07:11,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:07:11,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 05:07:11,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-20 05:07:11,312 INFO L87 Difference]: Start difference. First operand 157 states and 251 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-20 05:07:23,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-20 05:07:29,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:07:29,097 INFO L93 Difference]: Finished difference Result 675 states and 1035 transitions. [2024-11-20 05:07:29,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-20 05:07:29,105 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 177 [2024-11-20 05:07:29,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:07:29,111 INFO L225 Difference]: With dead ends: 675 [2024-11-20 05:07:29,111 INFO L226 Difference]: Without dead ends: 521 [2024-11-20 05:07:29,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2024-11-20 05:07:29,114 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 408 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:07:29,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 459 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2024-11-20 05:07:29,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-11-20 05:07:29,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 337. [2024-11-20 05:07:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 212 states have (on average 1.330188679245283) internal successors, (282), 212 states have internal predecessors, (282), 112 states have call successors, (112), 12 states have call predecessors, (112), 12 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-20 05:07:29,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 506 transitions. [2024-11-20 05:07:29,207 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 506 transitions. Word has length 177 [2024-11-20 05:07:29,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:07:29,208 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 506 transitions. [2024-11-20 05:07:29,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-20 05:07:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 506 transitions. [2024-11-20 05:07:29,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-20 05:07:29,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:07:29,218 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:07:29,237 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-20 05:07:29,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-20 05:07:29,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-20 05:07:29,619 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:07:29,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:07:29,620 INFO L85 PathProgramCache]: Analyzing trace with hash 714027138, now seen corresponding path program 1 times [2024-11-20 05:07:29,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:07:29,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587006809] [2024-11-20 05:07:29,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:07:29,621 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-20 05:07:29,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:07:29,622 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-20 05:07:29,623 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-20 05:07:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:07:30,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 05:07:30,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:07:48,916 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse5 (fp.neg .cse0)) (.cse4 (fp.neg .cse2))) (let ((.cse3 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (fp.geq ~var_1_26~0 .cse4)))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 158.0 5.0))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2) .cse3)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse5) (fp.geq ~var_1_24~0 .cse4))) (fp.leq ~var_1_25~0 .cse5))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse5))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5) (fp.geq ~var_1_24~0 .cse4))) .cse3)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse5) (fp.geq ~var_1_24~0 .cse4))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (not (fp.lt .cse1 ~var_1_24~0)))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5) (fp.geq ~var_1_24~0 .cse4))) (fp.leq ~var_1_25~0 .cse5))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5) (fp.geq ~var_1_24~0 .cse4))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse5) (fp.geq ~var_1_24~0 .cse4))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (not (fp.lt .cse1 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse5))))))) is different from true [2024-11-20 05:07:57,018 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 158.0 5.0)))) (.cse1 (fp.neg .cse3)) (.cse0 (fp.neg .cse2))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1) (fp.geq ~var_1_24~0 .cse0))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (fp.geq ~var_1_24~0 .cse3) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)) (not (fp.lt .cse4 ~var_1_24~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (fp.geq ~var_1_24~0 .cse3) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse4 ~var_1_24~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse4 ~var_1_24~0)))) (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (fp.leq ~var_1_24~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (not (fp.lt .cse4 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1) (fp.geq ~var_1_24~0 .cse0))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (not (fp.lt .cse4 ~var_1_24~0)))) (fp.leq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse3) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse3) (not (fp.lt .cse4 ~var_1_24~0)))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1) (fp.geq ~var_1_24~0 .cse0))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1) (fp.geq ~var_1_24~0 .cse0))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse3) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse3) (fp.leq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1) (fp.geq ~var_1_24~0 .cse0)))))))) is different from false [2024-11-20 05:08:06,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-20 05:08:06,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:08:06,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:08:06,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587006809] [2024-11-20 05:08:06,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587006809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:08:06,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:08:06,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 05:08:06,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102841542] [2024-11-20 05:08:06,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:08:06,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 05:08:06,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:08:06,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 05:08:06,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=111, Unknown=2, NotChecked=46, Total=210 [2024-11-20 05:08:06,306 INFO L87 Difference]: Start difference. First operand 337 states and 506 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28)