./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-pe-ci_file-62.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-pe-ci_file-62.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 d2d49c0a5e75da8ae49630f3d5e91c2d1a9c3582cbe11ea11cc5a687ad347724 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:05:08,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:05:08,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 04:05:08,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:05:08,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:05:08,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:05:08,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:05:08,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:05:08,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:05:08,974 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:05:08,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:05:08,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:05:08,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:05:08,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:05:08,976 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:05:08,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:05:08,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:05:08,977 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:05:08,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 04:05:08,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:05:08,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:05:08,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:05:08,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:05:08,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:05:08,983 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:05:08,983 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:05:08,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:05:08,983 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:05:08,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:05:08,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:05:08,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:05:08,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:05:08,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:05:08,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:05:08,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:05:08,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:05:08,986 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 04:05:08,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 04:05:08,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:05:08,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:05:08,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:05:08,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:05:08,989 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 -> d2d49c0a5e75da8ae49630f3d5e91c2d1a9c3582cbe11ea11cc5a687ad347724 [2024-11-20 04:05:09,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:05:09,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:05:09,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:05:09,283 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:05:09,284 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:05:09,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i [2024-11-20 04:05:10,724 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:05:10,964 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:05:10,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i [2024-11-20 04:05:10,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/213dec87c/9f6acfef74a34481948393598739fb3d/FLAGe32cb4d2f [2024-11-20 04:05:10,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/213dec87c/9f6acfef74a34481948393598739fb3d [2024-11-20 04:05:11,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:05:11,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:05:11,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:05:11,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:05:11,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:05:11,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:05:11" (1/1) ... [2024-11-20 04:05:11,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302caea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:11, skipping insertion in model container [2024-11-20 04:05:11,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:05:11" (1/1) ... [2024-11-20 04:05:11,047 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:05:11,227 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-pe-ci_file-62.i[919,932] [2024-11-20 04:05:11,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:05:11,339 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:05:11,355 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-pe-ci_file-62.i[919,932] [2024-11-20 04:05:11,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:05:11,414 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:05:11,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:11 WrapperNode [2024-11-20 04:05:11,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:05:11,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:05:11,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:05:11,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:05:11,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:11" (1/1) ... [2024-11-20 04:05:11,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:11" (1/1) ... [2024-11-20 04:05:11,497 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2024-11-20 04:05:11,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:05:11,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:05:11,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:05:11,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:05:11,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:11" (1/1) ... [2024-11-20 04:05:11,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:11" (1/1) ... [2024-11-20 04:05:11,514 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:11" (1/1) ... [2024-11-20 04:05:11,535 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 04:05:11,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:11" (1/1) ... [2024-11-20 04:05:11,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:11" (1/1) ... [2024-11-20 04:05:11,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:11" (1/1) ... [2024-11-20 04:05:11,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:11" (1/1) ... [2024-11-20 04:05:11,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:11" (1/1) ... [2024-11-20 04:05:11,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:11" (1/1) ... [2024-11-20 04:05:11,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:05:11,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:05:11,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:05:11,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:05:11,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:11" (1/1) ... [2024-11-20 04:05:11,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:05:11,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:05:11,609 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 04:05:11,612 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 04:05:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:05:11,666 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:05:11,667 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:05:11,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 04:05:11,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:05:11,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:05:11,763 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:05:11,766 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:05:12,169 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-20 04:05:12,170 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:05:12,186 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:05:12,187 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:05:12,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:05:12 BoogieIcfgContainer [2024-11-20 04:05:12,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:05:12,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:05:12,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:05:12,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:05:12,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:05:11" (1/3) ... [2024-11-20 04:05:12,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbe40e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:05:12, skipping insertion in model container [2024-11-20 04:05:12,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:11" (2/3) ... [2024-11-20 04:05:12,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbe40e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:05:12, skipping insertion in model container [2024-11-20 04:05:12,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:05:12" (3/3) ... [2024-11-20 04:05:12,200 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i [2024-11-20 04:05:12,216 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:05:12,216 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:05:12,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:05:12,327 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;@761a981f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:05:12,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:05:12,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 67 states have (on average 1.462686567164179) internal successors, (98), 68 states have internal predecessors, (98), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-20 04:05:12,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 04:05:12,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:12,348 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:12,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:12,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:12,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1604698210, now seen corresponding path program 1 times [2024-11-20 04:05:12,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:12,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167986770] [2024-11-20 04:05:12,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:12,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:05:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:05:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 04:05:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:05:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:05:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-20 04:05:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:05:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:05:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:05:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:05:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:05:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:05:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:05:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:05:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:05:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:05:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:05:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:05:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:05:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:05:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:05:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:05:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:05:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:05:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:05:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:05:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:05:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:05:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:05:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 04:05:12,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:05:12,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167986770] [2024-11-20 04:05:12,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167986770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:05:12,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:05:12,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:05:12,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895477269] [2024-11-20 04:05:12,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:05:12,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:05:12,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:05:12,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:05:12,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:05:12,897 INFO L87 Difference]: Start difference. First operand has 99 states, 67 states have (on average 1.462686567164179) internal successors, (98), 68 states have internal predecessors, (98), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 04:05:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:12,928 INFO L93 Difference]: Finished difference Result 187 states and 329 transitions. [2024-11-20 04:05:12,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:05:12,930 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 191 [2024-11-20 04:05:12,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:12,937 INFO L225 Difference]: With dead ends: 187 [2024-11-20 04:05:12,937 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 04:05:12,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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 04:05:12,946 INFO L432 NwaCegarLoop]: 137 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, 137 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 04:05:12,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:05:12,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 04:05:12,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-20 04:05:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-20 04:05:12,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 137 transitions. [2024-11-20 04:05:12,998 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 137 transitions. Word has length 191 [2024-11-20 04:05:12,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:12,999 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 137 transitions. [2024-11-20 04:05:12,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 04:05:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 137 transitions. [2024-11-20 04:05:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 04:05:13,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:13,003 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:13,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 04:05:13,004 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:13,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:13,004 INFO L85 PathProgramCache]: Analyzing trace with hash 402394394, now seen corresponding path program 1 times [2024-11-20 04:05:13,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:13,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863680696] [2024-11-20 04:05:13,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:13,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:05:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:05:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 04:05:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:05:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:05:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-20 04:05:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:05:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:05:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:05:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:05:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:05:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:05:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:05:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:05:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:05:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:05:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:05:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:05:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:05:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:05:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:05:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:05:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:05:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:05:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:05:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:05:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:05:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:05:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:05:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 04:05:13,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:05:13,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863680696] [2024-11-20 04:05:13,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863680696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:05:13,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:05:13,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:05:13,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925473453] [2024-11-20 04:05:13,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:05:13,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:05:13,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:05:13,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:05:13,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:05:13,434 INFO L87 Difference]: Start difference. First operand 91 states and 137 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:05:13,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:13,521 INFO L93 Difference]: Finished difference Result 230 states and 345 transitions. [2024-11-20 04:05:13,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:05:13,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-20 04:05:13,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:13,525 INFO L225 Difference]: With dead ends: 230 [2024-11-20 04:05:13,525 INFO L226 Difference]: Without dead ends: 142 [2024-11-20 04:05:13,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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 04:05:13,528 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 54 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:05:13,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 278 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:05:13,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-20 04:05:13,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2024-11-20 04:05:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 98 states have (on average 1.316326530612245) internal successors, (129), 99 states have internal predecessors, (129), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-20 04:05:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 205 transitions. [2024-11-20 04:05:13,564 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 205 transitions. Word has length 191 [2024-11-20 04:05:13,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:13,565 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 205 transitions. [2024-11-20 04:05:13,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:05:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 205 transitions. [2024-11-20 04:05:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 04:05:13,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:13,570 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:13,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 04:05:13,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:13,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:13,572 INFO L85 PathProgramCache]: Analyzing trace with hash -406952232, now seen corresponding path program 1 times [2024-11-20 04:05:13,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:13,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779083248] [2024-11-20 04:05:13,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:13,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:05:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:05:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 04:05:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:05:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:05:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-20 04:05:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:05:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:05:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:05:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:05:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:05:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:05:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:05:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:05:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:05:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:05:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:05:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:05:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:05:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:05:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:05:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:05:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:05:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:05:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:05:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:05:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:05:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:05:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:05:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 04:05:13,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:05:13,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779083248] [2024-11-20 04:05:13,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779083248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:05:13,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:05:13,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:05:13,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112436349] [2024-11-20 04:05:13,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:05:13,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:05:13,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:05:13,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:05:13,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:05:13,951 INFO L87 Difference]: Start difference. First operand 139 states and 205 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:05:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:14,172 INFO L93 Difference]: Finished difference Result 322 states and 468 transitions. [2024-11-20 04:05:14,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:05:14,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-20 04:05:14,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:14,177 INFO L225 Difference]: With dead ends: 322 [2024-11-20 04:05:14,179 INFO L226 Difference]: Without dead ends: 186 [2024-11-20 04:05:14,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:05:14,181 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 163 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:05:14,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 298 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 04:05:14,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-20 04:05:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 139. [2024-11-20 04:05:14,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 99 states have internal predecessors, (128), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-20 04:05:14,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 204 transitions. [2024-11-20 04:05:14,213 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 204 transitions. Word has length 191 [2024-11-20 04:05:14,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:14,215 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 204 transitions. [2024-11-20 04:05:14,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:05:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 204 transitions. [2024-11-20 04:05:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 04:05:14,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:14,220 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:14,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 04:05:14,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:14,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:14,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1893870358, now seen corresponding path program 1 times [2024-11-20 04:05:14,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:14,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75597631] [2024-11-20 04:05:14,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:14,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:05:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:05:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 04:05:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:05:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:05:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-20 04:05:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:05:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:05:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:05:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:05:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:05:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:05:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:05:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:05:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:05:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:05:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:05:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:05:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:05:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:05:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:05:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:05:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:05:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:05:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:05:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:05:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:05:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:05:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:05:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-20 04:05:14,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:05:14,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75597631] [2024-11-20 04:05:14,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75597631] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:05:14,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647941090] [2024-11-20 04:05:14,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:14,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:05:14,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:05:14,633 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 04:05:14,643 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 04:05:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:14,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 04:05:14,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:05:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-20 04:05:15,130 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:05:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-20 04:05:15,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647941090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:05:15,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:05:15,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-20 04:05:15,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646761881] [2024-11-20 04:05:15,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:05:15,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 04:05:15,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:05:15,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 04:05:15,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-20 04:05:15,424 INFO L87 Difference]: Start difference. First operand 139 states and 204 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-20 04:05:15,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:15,760 INFO L93 Difference]: Finished difference Result 361 states and 510 transitions. [2024-11-20 04:05:15,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 04:05:15,761 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 191 [2024-11-20 04:05:15,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:15,765 INFO L225 Difference]: With dead ends: 361 [2024-11-20 04:05:15,765 INFO L226 Difference]: Without dead ends: 225 [2024-11-20 04:05:15,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-20 04:05:15,767 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 190 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 04:05:15,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 329 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 04:05:15,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-20 04:05:15,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 172. [2024-11-20 04:05:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 129 states have (on average 1.2635658914728682) internal successors, (163), 130 states have internal predecessors, (163), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-20 04:05:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 239 transitions. [2024-11-20 04:05:15,795 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 239 transitions. Word has length 191 [2024-11-20 04:05:15,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:15,796 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 239 transitions. [2024-11-20 04:05:15,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-20 04:05:15,796 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 239 transitions. [2024-11-20 04:05:15,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 04:05:15,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:15,800 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:15,810 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 04:05:16,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:05:16,001 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:16,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:16,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1093786710, now seen corresponding path program 1 times [2024-11-20 04:05:16,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:16,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25636859] [2024-11-20 04:05:16,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:16,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:05:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:05:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 04:05:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:05:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:05:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-20 04:05:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:05:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:05:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:05:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:05:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:05:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:05:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:05:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:05:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:05:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:05:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:05:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:05:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:05:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:05:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:05:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:05:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:05:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:05:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:05:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:05:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:05:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:05:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:05:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 04:05:16,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:05:16,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25636859] [2024-11-20 04:05:16,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25636859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:05:16,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:05:16,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:05:16,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338519347] [2024-11-20 04:05:16,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:05:16,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:05:16,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:05:16,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:05:16,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:05:16,141 INFO L87 Difference]: Start difference. First operand 172 states and 239 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:05:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:16,185 INFO L93 Difference]: Finished difference Result 453 states and 618 transitions. [2024-11-20 04:05:16,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:05:16,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-20 04:05:16,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:16,191 INFO L225 Difference]: With dead ends: 453 [2024-11-20 04:05:16,192 INFO L226 Difference]: Without dead ends: 284 [2024-11-20 04:05:16,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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 04:05:16,194 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 77 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:05:16,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 285 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:05:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-20 04:05:16,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2024-11-20 04:05:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 212 states have (on average 1.221698113207547) internal successors, (259), 215 states have internal predecessors, (259), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 04:05:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 379 transitions. [2024-11-20 04:05:16,252 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 379 transitions. Word has length 191 [2024-11-20 04:05:16,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:16,252 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 379 transitions. [2024-11-20 04:05:16,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:05:16,253 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 379 transitions. [2024-11-20 04:05:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 04:05:16,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:16,255 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:16,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 04:05:16,255 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:16,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:16,256 INFO L85 PathProgramCache]: Analyzing trace with hash -494561192, now seen corresponding path program 1 times [2024-11-20 04:05:16,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:16,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010738505] [2024-11-20 04:05:16,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:16,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:05:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:05:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 04:05:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:05:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:05:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-20 04:05:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:05:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:05:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:05:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:05:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:05:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:05:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:05:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:05:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:05:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:05:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:05:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:05:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:05:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:05:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:05:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:05:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:05:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:05:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:05:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:05:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:05:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:05:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:05:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-20 04:05:16,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:05:16,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010738505] [2024-11-20 04:05:16,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010738505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:05:16,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022810115] [2024-11-20 04:05:16,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:16,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:05:16,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:05:16,744 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 04:05:16,745 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 04:05:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:16,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 04:05:16,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:05:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-20 04:05:19,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:05:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-20 04:05:20,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022810115] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:05:20,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:05:20,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-11-20 04:05:20,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246454120] [2024-11-20 04:05:20,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:05:20,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 04:05:20,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:05:20,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 04:05:20,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-20 04:05:20,003 INFO L87 Difference]: Start difference. First operand 281 states and 379 transitions. Second operand has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 4 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 4 states have call predecessors, (85), 4 states have call successors, (85) [2024-11-20 04:05:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:22,569 INFO L93 Difference]: Finished difference Result 567 states and 759 transitions. [2024-11-20 04:05:22,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 04:05:22,570 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 4 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 4 states have call predecessors, (85), 4 states have call successors, (85) Word has length 191 [2024-11-20 04:05:22,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:22,574 INFO L225 Difference]: With dead ends: 567 [2024-11-20 04:05:22,574 INFO L226 Difference]: Without dead ends: 289 [2024-11-20 04:05:22,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2024-11-20 04:05:22,577 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 154 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-20 04:05:22,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 240 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-20 04:05:22,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-20 04:05:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 247. [2024-11-20 04:05:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 181 states have internal predecessors, (215), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 04:05:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 335 transitions. [2024-11-20 04:05:22,619 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 335 transitions. Word has length 191 [2024-11-20 04:05:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:22,619 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 335 transitions. [2024-11-20 04:05:22,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 4 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 4 states have call predecessors, (85), 4 states have call successors, (85) [2024-11-20 04:05:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 335 transitions. [2024-11-20 04:05:22,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 04:05:22,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:22,623 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:22,633 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 04:05:22,827 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 04:05:22,828 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:22,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:22,829 INFO L85 PathProgramCache]: Analyzing trace with hash -287902149, now seen corresponding path program 1 times [2024-11-20 04:05:22,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:22,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653140464] [2024-11-20 04:05:22,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:22,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 04:05:22,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1188971415] [2024-11-20 04:05:22,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:22,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:05:22,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:05:22,928 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:05:22,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 04:05:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:05:23,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 04:05:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:05:23,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 04:05:23,449 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 04:05:23,450 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 04:05:23,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 04:05:23,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:05:23,656 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:05:23,795 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 04:05:23,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:05:23 BoogieIcfgContainer [2024-11-20 04:05:23,800 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 04:05:23,800 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 04:05:23,800 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 04:05:23,801 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 04:05:23,801 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:05:12" (3/4) ... [2024-11-20 04:05:23,803 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 04:05:23,804 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 04:05:23,805 INFO L158 Benchmark]: Toolchain (without parser) took 12800.53ms. Allocated memory was 178.3MB in the beginning and 312.5MB in the end (delta: 134.2MB). Free memory was 147.3MB in the beginning and 167.1MB in the end (delta: -19.8MB). Peak memory consumption was 114.8MB. Max. memory is 16.1GB. [2024-11-20 04:05:23,805 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 125.8MB. Free memory was 88.1MB in the beginning and 88.0MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:05:23,805 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.02ms. Allocated memory is still 178.3MB. Free memory was 147.3MB in the beginning and 130.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 04:05:23,805 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.86ms. Allocated memory is still 178.3MB. Free memory was 130.7MB in the beginning and 126.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 04:05:23,806 INFO L158 Benchmark]: Boogie Preprocessor took 64.63ms. Allocated memory is still 178.3MB. Free memory was 126.5MB in the beginning and 121.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 04:05:23,806 INFO L158 Benchmark]: RCFGBuilder took 623.06ms. Allocated memory is still 178.3MB. Free memory was 121.6MB in the beginning and 95.7MB in the end (delta: 25.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-20 04:05:23,807 INFO L158 Benchmark]: TraceAbstraction took 11609.62ms. Allocated memory was 178.3MB in the beginning and 312.5MB in the end (delta: 134.2MB). Free memory was 95.0MB in the beginning and 167.1MB in the end (delta: -72.1MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2024-11-20 04:05:23,807 INFO L158 Benchmark]: Witness Printer took 4.14ms. Allocated memory is still 312.5MB. Free memory is still 167.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:05:23,809 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 125.8MB. Free memory was 88.1MB in the beginning and 88.0MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.02ms. Allocated memory is still 178.3MB. Free memory was 147.3MB in the beginning and 130.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.86ms. Allocated memory is still 178.3MB. Free memory was 130.7MB in the beginning and 126.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.63ms. Allocated memory is still 178.3MB. Free memory was 126.5MB in the beginning and 121.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 623.06ms. Allocated memory is still 178.3MB. Free memory was 121.6MB in the beginning and 95.7MB in the end (delta: 25.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11609.62ms. Allocated memory was 178.3MB in the beginning and 312.5MB in the end (delta: 134.2MB). Free memory was 95.0MB in the beginning and 167.1MB in the end (delta: -72.1MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. * Witness Printer took 4.14ms. Allocated memory is still 312.5MB. Free memory is still 167.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 175, overapproximation of shiftRight at line 110, overapproximation of someBinaryArithmeticDOUBLEoperation at line 122, overapproximation of someUnaryDOUBLEoperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 175. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.25; [L23] signed long int var_1_3 = -25; [L24] signed long int var_1_4 = -128; [L25] double var_1_6 = 2.75; [L26] double var_1_7 = 24.5; [L27] double var_1_8 = 199.5; [L28] float var_1_9 = 32.8; [L29] unsigned char var_1_10 = 1; [L30] float var_1_11 = 15.4; [L31] float var_1_12 = 0.0; [L32] unsigned long int var_1_13 = 2; [L33] float var_1_16 = 127.6; [L34] signed long int var_1_17 = 128; [L35] unsigned char var_1_19 = 10; [L36] unsigned char var_1_20 = 0; [L37] unsigned char var_1_21 = 64; [L38] double var_1_22 = 15.95; [L39] unsigned long int var_1_23 = 4127848294; [L40] unsigned long int var_1_24 = 256; [L41] unsigned char var_1_27 = 1; [L42] unsigned char var_1_29 = 1; [L43] unsigned char var_1_30 = 0; [L44] unsigned char var_1_31 = 1; [L45] double var_1_32 = 32.7; [L46] unsigned char var_1_34 = 1; [L47] unsigned long int var_1_35 = 1000; [L48] signed char var_1_39 = -32; [L49] signed char var_1_40 = 16; [L50] signed char var_1_41 = 4; [L51] unsigned char var_1_42 = 0; [L52] unsigned char var_1_43 = 0; [L53] float var_1_44 = 99999999999.2; VAL [isInitial=0, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-25, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L179] isInitial = 1 [L180] FCALL initially() [L181] COND TRUE 1 [L182] FCALL updateLastVariables() [L183] CALL updateVariables() [L126] var_1_3 = __VERIFIER_nondet_long() [L127] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L127] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L128] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L128] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L129] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L129] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L130] var_1_4 = __VERIFIER_nondet_long() [L131] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L131] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L132] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L132] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L133] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L133] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L134] var_1_6 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L135] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L136] var_1_7 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_8=399/2, var_1_9=164/5] [L137] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_8=399/2, var_1_9=164/5] [L138] var_1_8 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L139] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L140] var_1_10 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L141] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L142] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L142] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L143] var_1_11 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L144] RET assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L145] var_1_12 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L146] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L147] var_1_20 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L148] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L149] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L149] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L150] var_1_21 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L151] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L152] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L152] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L153] var_1_23 = __VERIFIER_nondet_ulong() [L154] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L154] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L155] CALL assume_abort_if_not(var_1_23 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L155] RET assume_abort_if_not(var_1_23 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L156] var_1_29 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L157] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L158] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L158] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L159] var_1_30 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L160] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L161] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L161] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L162] var_1_40 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_40 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L163] RET assume_abort_if_not(var_1_40 >= -63) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L164] CALL assume_abort_if_not(var_1_40 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L164] RET assume_abort_if_not(var_1_40 <= 63) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L165] var_1_41 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_41 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L166] RET assume_abort_if_not(var_1_41 >= -127) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L167] CALL assume_abort_if_not(var_1_41 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L167] RET assume_abort_if_not(var_1_41 <= 126) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L168] var_1_43 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L169] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L170] CALL assume_abort_if_not(var_1_43 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L170] RET assume_abort_if_not(var_1_43 <= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_9=164/5] [L183] RET updateVariables() [L184] CALL step() [L57] COND TRUE var_1_12 <= (var_1_7 * 5.8f) [L58] var_1_16 = ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=164/5] [L62] COND TRUE var_1_10 || var_1_20 [L63] var_1_19 = ((((var_1_21) > (32)) ? (var_1_21) : (32))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=34, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=164/5] [L65] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=34, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=164/5] [L70] signed long int stepLocal_0 = (var_1_3 % var_1_4) * var_1_19; VAL [isInitial=1, stepLocal_0=-34, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=34, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=164/5] [L71] COND TRUE var_1_19 > stepLocal_0 [L72] var_1_1 = (var_1_6 - (var_1_7 + var_1_8)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=164/5] [L76] COND TRUE ! var_1_10 [L77] var_1_13 = (50u + var_1_19) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=164/5] [L81] COND FALSE !(var_1_8 < (var_1_22 / var_1_12)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=164/5] [L86] COND FALSE !(var_1_10 || (var_1_19 == var_1_13)) [L89] var_1_9 = ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=3] [L91] COND TRUE \read(var_1_20) [L92] var_1_24 = ((((((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) < (64u)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (64u)))) > (32u)) ? (((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) < (64u)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (64u)))) : (32u))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=3] [L94] COND FALSE !(var_1_19 <= 32u) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=3] [L99] COND TRUE (~ var_1_19) < var_1_19 [L100] var_1_27 = 0 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=3] [L105] var_1_31 = var_1_30 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=3] [L106] COND TRUE var_1_19 <= var_1_19 [L107] var_1_32 = (((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) < 0 ) ? -((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) : ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=3] [L109] var_1_34 = (! (var_1_10 && var_1_30)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=3] [L110] EXPR var_1_3 >> var_1_19 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=3] [L110] COND FALSE !(((var_1_3 >> var_1_19) % -10) >= var_1_19) [L115] COND FALSE !(-32 >= var_1_19) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=3] [L118] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=3] [L121] COND TRUE var_1_12 < ((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))) [L122] var_1_44 = (var_1_8 + var_1_11) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=3] [L184] RET step() [L185] CALL, EXPR property() [L175] EXPR (((((((var_1_19 > ((var_1_3 % var_1_4) * var_1_19)) ? (var_1_1 == ((double) (var_1_6 - (var_1_7 + var_1_8)))) : (var_1_1 == ((double) (var_1_6 - (var_1_8 + var_1_7))))) && ((var_1_10 || (var_1_19 == var_1_13)) ? (var_1_9 == ((float) ((127.5f - ((((var_1_8) > (var_1_7)) ? (var_1_8) : (var_1_7)))) + (16.1f + var_1_11)))) : (var_1_9 == ((float) ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))))))) && ((! var_1_10) ? (var_1_13 == ((unsigned long int) (50u + var_1_19))) : (var_1_13 == ((unsigned long int) (var_1_19 + var_1_19))))) && ((var_1_12 <= (var_1_7 * 5.8f)) ? (var_1_16 == ((float) ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))))) : (var_1_16 == ((float) var_1_6)))) && ((var_1_8 < (var_1_22 / var_1_12)) ? ((var_1_22 > var_1_6) ? (var_1_17 == ((signed long int) var_1_19)) : 1) : 1)) && ((var_1_10 || var_1_20) ? (var_1_19 == ((unsigned char) ((((var_1_21) > (32)) ? (var_1_21) : (32))))) : 1)) && (var_1_10 ? (((var_1_19 | var_1_19) != (var_1_23 - var_1_19)) ? (var_1_22 == ((double) 4.75)) : 1) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=3] [L175-L176] return (((((((var_1_19 > ((var_1_3 % var_1_4) * var_1_19)) ? (var_1_1 == ((double) (var_1_6 - (var_1_7 + var_1_8)))) : (var_1_1 == ((double) (var_1_6 - (var_1_8 + var_1_7))))) && ((var_1_10 || (var_1_19 == var_1_13)) ? (var_1_9 == ((float) ((127.5f - ((((var_1_8) > (var_1_7)) ? (var_1_8) : (var_1_7)))) + (16.1f + var_1_11)))) : (var_1_9 == ((float) ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))))))) && ((! var_1_10) ? (var_1_13 == ((unsigned long int) (50u + var_1_19))) : (var_1_13 == ((unsigned long int) (var_1_19 + var_1_19))))) && ((var_1_12 <= (var_1_7 * 5.8f)) ? (var_1_16 == ((float) ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))))) : (var_1_16 == ((float) var_1_6)))) && ((var_1_8 < (var_1_22 / var_1_12)) ? ((var_1_22 > var_1_6) ? (var_1_17 == ((signed long int) var_1_19)) : 1) : 1)) && ((var_1_10 || var_1_20) ? (var_1_19 == ((unsigned char) ((((var_1_21) > (32)) ? (var_1_21) : (32))))) : 1)) && (var_1_10 ? (((var_1_19 | var_1_19) != (var_1_23 - var_1_19)) ? (var_1_22 == ((double) 4.75)) : 1) : 1) ; [L185] RET, EXPR property() [L185] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=3] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-1, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_4=4, var_1_7=0, var_1_8=0, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 7, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 638 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 638 mSDsluCounter, 1567 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 774 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 725 IncrementalHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 793 mSDtfsCounter, 725 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1173 GetRequests, 1139 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=5, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 148 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1912 NumberOfCodeBlocks, 1912 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1900 ConstructedInterpolants, 11 QuantifiedInterpolants, 6175 SizeOfPredicates, 4 NumberOfNonLiveVariables, 857 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 15772/16240 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 04:05:23,843 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-pe-ci_file-62.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 d2d49c0a5e75da8ae49630f3d5e91c2d1a9c3582cbe11ea11cc5a687ad347724 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:05:26,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:05:26,149 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 04:05:26,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:05:26,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:05:26,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:05:26,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:05:26,185 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:05:26,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:05:26,187 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:05:26,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:05:26,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:05:26,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:05:26,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:05:26,189 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:05:26,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:05:26,193 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:05:26,193 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:05:26,193 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:05:26,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:05:26,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:05:26,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:05:26,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:05:26,195 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 04:05:26,195 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 04:05:26,195 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:05:26,196 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 04:05:26,196 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:05:26,196 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:05:26,196 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:05:26,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:05:26,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:05:26,197 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:05:26,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:05:26,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:05:26,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:05:26,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:05:26,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:05:26,200 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 04:05:26,200 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 04:05:26,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:05:26,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:05:26,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:05:26,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:05:26,201 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 -> d2d49c0a5e75da8ae49630f3d5e91c2d1a9c3582cbe11ea11cc5a687ad347724 [2024-11-20 04:05:26,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:05:26,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:05:26,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:05:26,576 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:05:26,577 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:05:26,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i [2024-11-20 04:05:28,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:05:28,360 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:05:28,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i [2024-11-20 04:05:28,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5473eb563/ba4a0e00bd3443918866463626707f26/FLAG3b67d3323 [2024-11-20 04:05:28,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5473eb563/ba4a0e00bd3443918866463626707f26 [2024-11-20 04:05:28,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:05:28,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:05:28,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:05:28,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:05:28,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:05:28,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:05:28" (1/1) ... [2024-11-20 04:05:28,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c85239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:28, skipping insertion in model container [2024-11-20 04:05:28,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:05:28" (1/1) ... [2024-11-20 04:05:28,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:05:28,944 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-pe-ci_file-62.i[919,932] [2024-11-20 04:05:29,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:05:29,055 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:05:29,081 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-pe-ci_file-62.i[919,932] [2024-11-20 04:05:29,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:05:29,168 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:05:29,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:29 WrapperNode [2024-11-20 04:05:29,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:05:29,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:05:29,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:05:29,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:05:29,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:29" (1/1) ... [2024-11-20 04:05:29,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:29" (1/1) ... [2024-11-20 04:05:29,242 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-11-20 04:05:29,243 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:05:29,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:05:29,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:05:29,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:05:29,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:29" (1/1) ... [2024-11-20 04:05:29,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:29" (1/1) ... [2024-11-20 04:05:29,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:29" (1/1) ... [2024-11-20 04:05:29,296 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 04:05:29,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:29" (1/1) ... [2024-11-20 04:05:29,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:29" (1/1) ... [2024-11-20 04:05:29,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:29" (1/1) ... [2024-11-20 04:05:29,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:29" (1/1) ... [2024-11-20 04:05:29,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:29" (1/1) ... [2024-11-20 04:05:29,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:29" (1/1) ... [2024-11-20 04:05:29,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:05:29,339 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:05:29,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:05:29,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:05:29,340 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:29" (1/1) ... [2024-11-20 04:05:29,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:05:29,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:05:29,376 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 04:05:29,379 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 04:05:29,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:05:29,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 04:05:29,413 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:05:29,413 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:05:29,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:05:29,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:05:29,496 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:05:29,498 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:06:00,230 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-20 04:06:00,230 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:06:00,249 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:06:00,249 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:06:00,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:06:00 BoogieIcfgContainer [2024-11-20 04:06:00,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:06:00,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:06:00,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:06:00,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:06:00,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:05:28" (1/3) ... [2024-11-20 04:06:00,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4dab4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:06:00, skipping insertion in model container [2024-11-20 04:06:00,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:29" (2/3) ... [2024-11-20 04:06:00,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4dab4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:06:00, skipping insertion in model container [2024-11-20 04:06:00,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:06:00" (3/3) ... [2024-11-20 04:06:00,263 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i [2024-11-20 04:06:00,281 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:06:00,282 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:06:00,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:06:00,370 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;@56a537d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:06:00,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:06:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-20 04:06:00,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-20 04:06:00,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:06:00,394 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:06:00,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:06:00,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:06:00,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1979626511, now seen corresponding path program 1 times [2024-11-20 04:06:00,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:06:00,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621178083] [2024-11-20 04:06:00,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:06:00,421 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 04:06:00,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:06:00,425 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 04:06:00,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 04:06:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:06:01,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 04:06:01,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:06:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-11-20 04:06:01,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:06:01,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:06:01,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621178083] [2024-11-20 04:06:01,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621178083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:06:01,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:06:01,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:06:01,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625004813] [2024-11-20 04:06:01,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:06:02,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:06:02,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:06:02,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:06:02,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:06:02,029 INFO L87 Difference]: Start difference. First operand has 86 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 04:06:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:06:02,056 INFO L93 Difference]: Finished difference Result 165 states and 295 transitions. [2024-11-20 04:06:02,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:06:02,060 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 188 [2024-11-20 04:06:02,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:06:02,067 INFO L225 Difference]: With dead ends: 165 [2024-11-20 04:06:02,068 INFO L226 Difference]: Without dead ends: 82 [2024-11-20 04:06:02,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 187 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 04:06:02,074 INFO L432 NwaCegarLoop]: 125 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, 125 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 04:06:02,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:06:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-20 04:06:02,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-20 04:06:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-20 04:06:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2024-11-20 04:06:02,120 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 188 [2024-11-20 04:06:02,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:06:02,121 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2024-11-20 04:06:02,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 04:06:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2024-11-20 04:06:02,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-20 04:06:02,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:06:02,126 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:06:02,166 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 04:06:02,327 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 04:06:02,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:06:02,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:06:02,329 INFO L85 PathProgramCache]: Analyzing trace with hash -2003651845, now seen corresponding path program 1 times [2024-11-20 04:06:02,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:06:02,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951918900] [2024-11-20 04:06:02,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:06:02,331 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 04:06:02,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:06:02,333 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 04:06:02,335 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 04:06:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:06:03,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 04:06:03,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:06:04,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 04:06:04,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:06:04,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:06:04,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951918900] [2024-11-20 04:06:04,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951918900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:06:04,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:06:04,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:06:04,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938474188] [2024-11-20 04:06:04,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:06:04,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:06:04,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:06:04,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:06:04,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:06:04,454 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:06:08,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:06:12,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:06:17,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:06:21,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:06:25,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:06:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:06:25,917 INFO L93 Difference]: Finished difference Result 206 states and 312 transitions. [2024-11-20 04:06:25,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:06:25,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-11-20 04:06:25,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:06:25,921 INFO L225 Difference]: With dead ends: 206 [2024-11-20 04:06:25,922 INFO L226 Difference]: Without dead ends: 127 [2024-11-20 04:06:25,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:06:25,924 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 48 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2024-11-20 04:06:25,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 259 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 21.4s Time] [2024-11-20 04:06:25,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-20 04:06:25,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2024-11-20 04:06:25,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 84 states have internal predecessors, (109), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-20 04:06:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 185 transitions. [2024-11-20 04:06:25,944 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 185 transitions. Word has length 188 [2024-11-20 04:06:25,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:06:25,945 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 185 transitions. [2024-11-20 04:06:25,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:06:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 185 transitions. [2024-11-20 04:06:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-20 04:06:25,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:06:25,949 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:06:26,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 04:06:26,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:06:26,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:06:26,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:06:26,151 INFO L85 PathProgramCache]: Analyzing trace with hash -358045641, now seen corresponding path program 1 times [2024-11-20 04:06:26,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:06:26,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734434071] [2024-11-20 04:06:26,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:06:26,152 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 04:06:26,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:06:26,156 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:06:26,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 04:06:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:06:27,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 04:06:27,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:06:28,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 04:06:28,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:06:28,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:06:28,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734434071] [2024-11-20 04:06:28,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734434071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:06:28,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:06:28,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:06:28,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535516355] [2024-11-20 04:06:28,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:06:28,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:06:28,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:06:28,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:06:28,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:06:28,267 INFO L87 Difference]: Start difference. First operand 124 states and 185 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:06:31,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:06:35,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:06:39,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:06:43,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []