./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.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 c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:20:22,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:20:22,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:20:22,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:20:22,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:20:22,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:20:22,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:20:22,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:20:22,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:20:22,889 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:20:22,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:20:22,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:20:22,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:20:22,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:20:22,892 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:20:22,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:20:22,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:20:22,892 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:20:22,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:20:22,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:20:22,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:20:22,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:20:22,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:20:22,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:20:22,896 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:20:22,896 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:20:22,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:20:22,897 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:20:22,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:20:22,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:20:22,897 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:20:22,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:20:22,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:20:22,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:20:22,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:20:22,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:20:22,898 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:20:22,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:20:22,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:20:22,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:20:22,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:20:22,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:20:22,899 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 -> c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 [2024-11-08 23:20:23,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:20:23,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:20:23,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:20:23,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:20:23,145 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:20:23,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-11-08 23:20:24,424 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:20:24,600 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:20:24,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-11-08 23:20:24,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0b403937/db7922c4cfb743928cbd0e1292ec6d08/FLAG5b68f3d21 [2024-11-08 23:20:24,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0b403937/db7922c4cfb743928cbd0e1292ec6d08 [2024-11-08 23:20:24,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:20:24,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:20:24,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:20:24,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:20:24,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:20:24,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:20:24" (1/1) ... [2024-11-08 23:20:24,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ee8a5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:24, skipping insertion in model container [2024-11-08 23:20:24,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:20:24" (1/1) ... [2024-11-08 23:20:24,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:20:24,794 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_loopvsstraightlinecode_100-1loop_file-48.i[916,929] [2024-11-08 23:20:24,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:20:24,860 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:20:24,869 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_loopvsstraightlinecode_100-1loop_file-48.i[916,929] [2024-11-08 23:20:24,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:20:24,933 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:20:24,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:24 WrapperNode [2024-11-08 23:20:24,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:20:24,934 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:20:24,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:20:24,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:20:24,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:24" (1/1) ... [2024-11-08 23:20:24,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:24" (1/1) ... [2024-11-08 23:20:24,985 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2024-11-08 23:20:24,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:20:24,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:20:24,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:20:24,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:20:24,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:24" (1/1) ... [2024-11-08 23:20:24,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:24" (1/1) ... [2024-11-08 23:20:24,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:24" (1/1) ... [2024-11-08 23:20:25,027 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:20:25,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:24" (1/1) ... [2024-11-08 23:20:25,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:24" (1/1) ... [2024-11-08 23:20:25,044 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:24" (1/1) ... [2024-11-08 23:20:25,047 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:24" (1/1) ... [2024-11-08 23:20:25,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:24" (1/1) ... [2024-11-08 23:20:25,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:24" (1/1) ... [2024-11-08 23:20:25,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:20:25,071 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:20:25,071 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:20:25,071 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:20:25,072 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:24" (1/1) ... [2024-11-08 23:20:25,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:20:25,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:20:25,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:20:25,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:20:25,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:20:25,140 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:20:25,141 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:20:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:20:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:20:25,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:20:25,216 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:20:25,218 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:20:25,609 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-08 23:20:25,609 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:20:25,622 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:20:25,622 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:20:25,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:20:25 BoogieIcfgContainer [2024-11-08 23:20:25,623 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:20:25,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:20:25,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:20:25,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:20:25,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:20:24" (1/3) ... [2024-11-08 23:20:25,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5536ee45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:20:25, skipping insertion in model container [2024-11-08 23:20:25,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:24" (2/3) ... [2024-11-08 23:20:25,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5536ee45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:20:25, skipping insertion in model container [2024-11-08 23:20:25,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:20:25" (3/3) ... [2024-11-08 23:20:25,629 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-11-08 23:20:25,644 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:20:25,645 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:20:25,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:20:25,698 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;@117cb27f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:20:25,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:20:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 23:20:25,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 23:20:25,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:20:25,712 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:20:25,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:20:25,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:20:25,716 INFO L85 PathProgramCache]: Analyzing trace with hash -955671759, now seen corresponding path program 1 times [2024-11-08 23:20:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:20:25,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599820262] [2024-11-08 23:20:25,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:20:25,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:20:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:25,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:20:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:25,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:20:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:25,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:20:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:25,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:20:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:25,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:20:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:25,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:20:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:25,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:20:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:20:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:20:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:20:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:20:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:20:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:20:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:20:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:20:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:20:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:20:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:20:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:20:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:20:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:20:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:20:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:20:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 23:20:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:20:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 23:20:26,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:20:26,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599820262] [2024-11-08 23:20:26,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599820262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:20:26,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:20:26,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:20:26,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458767887] [2024-11-08 23:20:26,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:20:26,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:20:26,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:20:26,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:20:26,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:20:26,118 INFO L87 Difference]: Start difference. First operand has 84 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 23:20:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:20:26,144 INFO L93 Difference]: Finished difference Result 165 states and 280 transitions. [2024-11-08 23:20:26,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:20:26,148 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2024-11-08 23:20:26,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:20:26,154 INFO L225 Difference]: With dead ends: 165 [2024-11-08 23:20:26,155 INFO L226 Difference]: Without dead ends: 80 [2024-11-08 23:20:26,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:20:26,162 INFO L432 NwaCegarLoop]: 126 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, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:20:26,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:20:26,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-08 23:20:26,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-08 23:20:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 23:20:26,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2024-11-08 23:20:26,211 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 165 [2024-11-08 23:20:26,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:20:26,212 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2024-11-08 23:20:26,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 23:20:26,213 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2024-11-08 23:20:26,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 23:20:26,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:20:26,216 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:20:26,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:20:26,216 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:20:26,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:20:26,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1513896379, now seen corresponding path program 1 times [2024-11-08 23:20:26,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:20:26,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413628794] [2024-11-08 23:20:26,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:20:26,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:20:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:20:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:20:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:20:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:20:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:20:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:20:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:20:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:20:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:20:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:20:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:20:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:20:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:20:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:20:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:20:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:20:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:20:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:20:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:20:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:20:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:20:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:20:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:20:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 23:20:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:20:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 23:20:26,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:20:26,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413628794] [2024-11-08 23:20:26,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413628794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:20:26,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:20:26,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:20:26,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070160982] [2024-11-08 23:20:26,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:20:26,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:20:26,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:20:26,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:20:26,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:20:26,767 INFO L87 Difference]: Start difference. First operand 80 states and 122 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 23:20:26,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:20:26,958 INFO L93 Difference]: Finished difference Result 235 states and 361 transitions. [2024-11-08 23:20:26,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:20:26,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2024-11-08 23:20:26,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:20:26,961 INFO L225 Difference]: With dead ends: 235 [2024-11-08 23:20:26,961 INFO L226 Difference]: Without dead ends: 158 [2024-11-08 23:20:26,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:20:26,963 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 90 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:20:26,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 342 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:20:26,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-08 23:20:26,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 126. [2024-11-08 23:20:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 73 states have internal predecessors, (92), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 23:20:26,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 192 transitions. [2024-11-08 23:20:26,993 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 192 transitions. Word has length 165 [2024-11-08 23:20:26,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:20:26,994 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 192 transitions. [2024-11-08 23:20:26,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 23:20:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 192 transitions. [2024-11-08 23:20:26,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 23:20:26,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:20:26,998 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:20:26,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:20:26,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:20:26,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:20:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash 958737469, now seen corresponding path program 1 times [2024-11-08 23:20:27,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:20:27,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781735883] [2024-11-08 23:20:27,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:20:27,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:20:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:20:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:20:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:20:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:20:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:20:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:20:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:20:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:20:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:20:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:20:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:20:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:20:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:20:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:20:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:20:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:20:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:20:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:20:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:20:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:20:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:20:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:20:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:20:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 23:20:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:20:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 23:20:27,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:20:27,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781735883] [2024-11-08 23:20:27,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781735883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:20:27,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198993030] [2024-11-08 23:20:27,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:20:27,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:20:27,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:20:27,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:20:27,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:20:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:27,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:20:27,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:20:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 568 proven. 24 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2024-11-08 23:20:27,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:20:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 23:20:27,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198993030] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:20:27,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:20:27,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 23:20:27,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287912210] [2024-11-08 23:20:27,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:20:27,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:20:27,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:20:27,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:20:27,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:20:27,954 INFO L87 Difference]: Start difference. First operand 126 states and 192 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-08 23:20:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:20:28,133 INFO L93 Difference]: Finished difference Result 219 states and 325 transitions. [2024-11-08 23:20:28,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:20:28,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 166 [2024-11-08 23:20:28,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:20:28,135 INFO L225 Difference]: With dead ends: 219 [2024-11-08 23:20:28,135 INFO L226 Difference]: Without dead ends: 142 [2024-11-08 23:20:28,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:20:28,137 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 75 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:20:28,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 220 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:20:28,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-08 23:20:28,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2024-11-08 23:20:28,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 79 states have internal predecessors, (97), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 23:20:28,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 197 transitions. [2024-11-08 23:20:28,156 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 197 transitions. Word has length 166 [2024-11-08 23:20:28,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:20:28,156 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 197 transitions. [2024-11-08 23:20:28,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-08 23:20:28,157 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 197 transitions. [2024-11-08 23:20:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 23:20:28,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:20:28,159 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:20:28,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:20:28,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:20:28,360 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:20:28,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:20:28,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1984475090, now seen corresponding path program 1 times [2024-11-08 23:20:28,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:20:28,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757672238] [2024-11-08 23:20:28,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:20:28,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:20:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:20:28,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1890102746] [2024-11-08 23:20:28,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:20:28,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:20:28,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:20:28,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:20:28,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 23:20:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:20:28,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:20:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:20:28,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:20:28,948 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:20:28,949 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:20:28,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 23:20:29,169 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,SelfDestructingSolverStorable3 [2024-11-08 23:20:29,172 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 23:20:29,251 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:20:29,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:20:29 BoogieIcfgContainer [2024-11-08 23:20:29,257 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:20:29,258 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:20:29,258 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:20:29,258 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:20:29,258 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:20:25" (3/4) ... [2024-11-08 23:20:29,260 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:20:29,261 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:20:29,262 INFO L158 Benchmark]: Toolchain (without parser) took 4632.94ms. Allocated memory was 157.3MB in the beginning and 195.0MB in the end (delta: 37.7MB). Free memory was 120.0MB in the beginning and 143.1MB in the end (delta: -23.1MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-11-08 23:20:29,262 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:20:29,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.49ms. Allocated memory is still 157.3MB. Free memory was 120.0MB in the beginning and 102.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:20:29,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.13ms. Allocated memory is still 157.3MB. Free memory was 102.2MB in the beginning and 96.4MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:20:29,262 INFO L158 Benchmark]: Boogie Preprocessor took 83.69ms. Allocated memory is still 157.3MB. Free memory was 95.9MB in the beginning and 84.6MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:20:29,262 INFO L158 Benchmark]: RCFGBuilder took 552.19ms. Allocated memory is still 157.3MB. Free memory was 84.6MB in the beginning and 102.3MB in the end (delta: -17.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:20:29,263 INFO L158 Benchmark]: TraceAbstraction took 3632.97ms. Allocated memory was 157.3MB in the beginning and 195.0MB in the end (delta: 37.7MB). Free memory was 101.4MB in the beginning and 144.1MB in the end (delta: -42.7MB). Peak memory consumption was 96.3MB. Max. memory is 16.1GB. [2024-11-08 23:20:29,263 INFO L158 Benchmark]: Witness Printer took 3.67ms. Allocated memory is still 195.0MB. Free memory was 144.1MB in the beginning and 143.1MB in the end (delta: 974.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:20:29,264 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.14ms. Allocated memory is still 104.9MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.49ms. Allocated memory is still 157.3MB. Free memory was 120.0MB in the beginning and 102.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.13ms. Allocated memory is still 157.3MB. Free memory was 102.2MB in the beginning and 96.4MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.69ms. Allocated memory is still 157.3MB. Free memory was 95.9MB in the beginning and 84.6MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 552.19ms. Allocated memory is still 157.3MB. Free memory was 84.6MB in the beginning and 102.3MB in the end (delta: -17.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3632.97ms. Allocated memory was 157.3MB in the beginning and 195.0MB in the end (delta: 37.7MB). Free memory was 101.4MB in the beginning and 144.1MB in the end (delta: -42.7MB). Peak memory consumption was 96.3MB. Max. memory is 16.1GB. * Witness Printer took 3.67ms. Allocated memory is still 195.0MB. Free memory was 144.1MB in the beginning and 143.1MB in the end (delta: 974.8kB). 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 187, overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryArithmeticFLOAToperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L23] unsigned char var_1_3 = 0; [L24] float var_1_8 = 128.5; [L25] float var_1_9 = 127.75; [L26] float var_1_10 = 31.8; [L27] float var_1_11 = 32.5; [L28] unsigned char var_1_12 = 8; [L29] unsigned char var_1_13 = 100; [L30] unsigned char var_1_14 = 25; [L31] unsigned char var_1_15 = 32; [L32] unsigned char var_1_16 = 16; [L33] double var_1_17 = 64.8; [L34] unsigned char var_1_18 = 1; [L35] unsigned char var_1_19 = 0; [L36] unsigned char var_1_20 = 0; [L37] signed char var_1_21 = -100; [L38] signed long int var_1_22 = -1; [L39] float var_1_23 = 5.6; [L40] float var_1_24 = 50.88; [L41] signed short int var_1_25 = -5; [L42] unsigned char var_1_26 = 1; [L43] unsigned char var_1_27 = 128; [L44] unsigned char var_1_28 = 5; [L45] signed short int var_1_29 = -64; [L46] unsigned long int var_1_32 = 16; [L47] unsigned char last_1_var_1_12 = 8; [L48] unsigned char last_1_var_1_18 = 1; [L49] signed short int last_1_var_1_25 = -5; [L50] unsigned char last_1_var_1_26 = 1; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=0, var_1_8=257/2, var_1_9=511/4] [L191] isInitial = 1 [L192] FCALL initially() [L193] int k_loop; [L194] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=0, var_1_8=257/2, var_1_9=511/4] [L194] COND TRUE k_loop < 1 [L195] CALL updateLastVariables() [L181] last_1_var_1_12 = var_1_12 [L182] last_1_var_1_18 = var_1_18 [L183] last_1_var_1_25 = var_1_25 [L184] last_1_var_1_26 = var_1_26 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=0, var_1_8=257/2, var_1_9=511/4] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_8=257/2, var_1_9=511/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_8=257/2, var_1_9=511/4] [L141] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_8=257/2, var_1_9=511/4] [L142] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2, var_1_9=511/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2, var_1_9=511/4] [L142] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2, var_1_9=511/4] [L143] var_1_9 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L144] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L145] var_1_10 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L146] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L147] var_1_11 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L148] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L149] var_1_13 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_13 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L150] RET assume_abort_if_not(var_1_13 >= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L151] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L151] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L152] var_1_14 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L153] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L154] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L154] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L155] var_1_15 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_15 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L156] RET assume_abort_if_not(var_1_15 >= 31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L157] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L157] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L158] var_1_16 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L159] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L160] CALL assume_abort_if_not(var_1_16 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L160] RET assume_abort_if_not(var_1_16 <= 31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L161] var_1_19 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L162] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L163] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L163] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L164] var_1_20 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L165] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L166] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L166] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L167] var_1_22 = __VERIFIER_nondet_long() [L168] CALL assume_abort_if_not(var_1_22 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L168] RET assume_abort_if_not(var_1_22 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L169] CALL assume_abort_if_not(var_1_22 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L169] RET assume_abort_if_not(var_1_22 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L170] CALL assume_abort_if_not(var_1_22 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L170] RET assume_abort_if_not(var_1_22 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L171] var_1_24 = __VERIFIER_nondet_float() [L172] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L172] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L173] var_1_27 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L174] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L175] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L175] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L176] var_1_28 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L177] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L178] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L178] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L196] RET updateVariables() [L197] CALL step() [L54] unsigned char stepLocal_1 = last_1_var_1_18; [L55] signed long int stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_0=8, stepLocal_1=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L56] COND TRUE last_1_var_1_18 || stepLocal_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_0=8, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L57] COND TRUE stepLocal_0 >= last_1_var_1_26 [L58] var_1_1 = (last_1_var_1_12 + last_1_var_1_12) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L65] unsigned long int stepLocal_8 = 10u / var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_8=0, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L66] COND TRUE ! var_1_20 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_8=0, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L67] COND TRUE stepLocal_8 < (var_1_22 + var_1_1) [L68] var_1_26 = ((((var_1_13) < ((var_1_27 - var_1_28))) ? (var_1_13) : ((var_1_27 - var_1_28)))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L73] signed long int stepLocal_4 = ((((var_1_16) < (var_1_13)) ? (var_1_16) : (var_1_13))) / var_1_22; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_4=-1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L74] COND TRUE ((25 + var_1_26) / var_1_15) > stepLocal_4 [L75] var_1_21 = ((((var_1_16) < (var_1_14)) ? (var_1_16) : (var_1_14))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L79] signed short int stepLocal_3 = var_1_1; [L80] signed char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_2=1, stepLocal_3=16, var_1_12=8, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L81] COND TRUE var_1_1 >= stepLocal_2 [L82] var_1_12 = ((var_1_13 - var_1_14) + (100 - (var_1_15 - var_1_16))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_3=16, var_1_12=193, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=16, var_1_3=-255, var_1_8=257/2] [L90] var_1_8 = ((var_1_9 - var_1_10) + var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_3=16, var_1_12=193, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=16, var_1_3=-255] [L91] COND TRUE \read(var_1_3) [L92] var_1_18 = (var_1_19 || ((var_1_10 > var_1_8) && var_1_20)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_3=16, var_1_12=193, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=16, var_1_3=-255] [L96] unsigned char stepLocal_10 = var_1_26; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=37, stepLocal_3=16, var_1_12=193, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=16, var_1_3=-255] [L97] COND FALSE !(var_1_8 <= (var_1_24 * ((((var_1_11) < (var_1_10)) ? (var_1_11) : (var_1_10))))) [L104] var_1_32 = var_1_27 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=37, stepLocal_3=16, var_1_12=193, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_17=324/5, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=127, var_1_3=-255] [L106] COND TRUE (((((var_1_13) > (0)) ? (var_1_13) : (0))) - var_1_32) >= var_1_32 [L107] var_1_17 = (var_1_10 + var_1_9) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=37, stepLocal_3=16, var_1_12=193, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=127, var_1_3=-255] [L113] COND TRUE var_1_32 <= (- var_1_21) [L114] var_1_23 = ((((((var_1_10) < (var_1_9)) ? (var_1_10) : (var_1_9))) - var_1_24) + var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=37, stepLocal_3=16, var_1_12=193, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-30, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=127, var_1_3=-255] [L118] signed long int stepLocal_7 = -32; [L119] unsigned long int stepLocal_6 = var_1_32; [L120] unsigned char stepLocal_5 = 10 > 8; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=37, stepLocal_3=16, stepLocal_5=1, stepLocal_6=127, stepLocal_7=-32, var_1_12=193, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-30, var_1_25=-5, var_1_26=37, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=127, var_1_3=-255] [L121] COND FALSE !(stepLocal_7 > (~ last_1_var_1_25)) [L128] var_1_25 = var_1_14 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=37, stepLocal_3=16, stepLocal_5=1, stepLocal_6=127, var_1_12=193, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-30, var_1_25=1, var_1_26=37, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=127, var_1_3=-255] [L130] unsigned char stepLocal_9 = var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=37, stepLocal_3=16, stepLocal_5=1, stepLocal_6=127, stepLocal_9=0, var_1_12=193, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-30, var_1_25=1, var_1_26=37, var_1_27=127, var_1_28=-166, var_1_29=-64, var_1_32=127, var_1_3=-255] [L131] COND FALSE !(stepLocal_9 && var_1_18) [L136] var_1_29 = 1000 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=37, stepLocal_3=16, stepLocal_5=1, stepLocal_6=127, var_1_12=193, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-30, var_1_25=1, var_1_26=37, var_1_27=127, var_1_28=-166, var_1_29=1000, var_1_32=127, var_1_3=-255] [L197] RET step() [L198] CALL, EXPR property() [L187-L188] return (((((((((((last_1_var_1_18 || last_1_var_1_18) ? ((last_1_var_1_12 >= last_1_var_1_26) ? (var_1_1 == ((signed short int) (last_1_var_1_12 + last_1_var_1_12))) : (var_1_1 == ((signed short int) last_1_var_1_12))) : (var_1_1 == ((signed short int) last_1_var_1_12))) && (var_1_8 == ((float) ((var_1_9 - var_1_10) + var_1_11)))) && ((var_1_1 >= var_1_21) ? (var_1_12 == ((unsigned char) ((var_1_13 - var_1_14) + (100 - (var_1_15 - var_1_16))))) : ((var_1_1 <= 100) ? (var_1_12 == ((unsigned char) ((((var_1_14) > (var_1_13)) ? (var_1_14) : (var_1_13))))) : (var_1_12 == ((unsigned char) var_1_13))))) && (((((((var_1_13) > (0)) ? (var_1_13) : (0))) - var_1_32) >= var_1_32) ? (var_1_17 == ((double) (var_1_10 + var_1_9))) : (var_1_18 ? (var_1_17 == ((double) var_1_9)) : 1))) && (var_1_3 ? (var_1_18 == ((unsigned char) (var_1_19 || ((var_1_10 > var_1_8) && var_1_20)))) : (var_1_18 == ((unsigned char) ((! (! var_1_19)) || var_1_20))))) && ((((25 + var_1_26) / var_1_15) > (((((var_1_16) < (var_1_13)) ? (var_1_16) : (var_1_13))) / var_1_22)) ? (var_1_21 == ((signed char) ((((var_1_16) < (var_1_14)) ? (var_1_16) : (var_1_14))))) : (var_1_21 == ((signed char) var_1_14)))) && ((var_1_32 <= (- var_1_21)) ? (var_1_23 == ((float) ((((((var_1_10) < (var_1_9)) ? (var_1_10) : (var_1_9))) - var_1_24) + var_1_11))) : (var_1_23 == ((float) ((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))))))) && ((-32 > (~ last_1_var_1_25)) ? (((var_1_10 <= (- var_1_9)) || (10 > 8)) ? ((last_1_var_1_25 > var_1_32) ? (var_1_25 == ((signed short int) var_1_32)) : 1) : 1) : (var_1_25 == ((signed short int) var_1_14)))) && ((! var_1_20) ? (((10u / var_1_13) < (var_1_22 + var_1_1)) ? (var_1_26 == ((unsigned char) ((((var_1_13) < ((var_1_27 - var_1_28))) ? (var_1_13) : ((var_1_27 - var_1_28)))))) : (var_1_26 == ((unsigned char) (var_1_16 + var_1_15)))) : 1)) && ((var_1_18 && var_1_18) ? (((var_1_10 - (var_1_9 + var_1_24)) == var_1_23) ? (var_1_29 == ((signed short int) ((((var_1_14) < (((((1) < (var_1_21)) ? (1) : (var_1_21))))) ? (var_1_14) : (((((1) < (var_1_21)) ? (1) : (var_1_21)))))))) : 1) : (var_1_29 == ((signed short int) 1000)))) && ((var_1_8 <= (var_1_24 * ((((var_1_11) < (var_1_10)) ? (var_1_11) : (var_1_10))))) ? ((var_1_26 > (- (- var_1_26))) ? (var_1_32 == ((unsigned long int) var_1_26)) : (var_1_32 == ((unsigned long int) var_1_13))) : (var_1_32 == ((unsigned long int) var_1_27))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=193, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-30, var_1_25=1, var_1_26=37, var_1_27=127, var_1_28=-166, var_1_29=1000, var_1_32=127, var_1_3=-255] [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=193, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-30, var_1_25=1, var_1_26=37, var_1_27=127, var_1_28=-166, var_1_29=1000, var_1_32=127, var_1_3=-255] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=193, var_1_13=-130, var_1_14=257, var_1_15=-961, var_1_16=31, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-30, var_1_25=1, var_1_26=37, var_1_27=127, var_1_28=-166, var_1_29=1000, var_1_32=127, var_1_3=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 4, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 688 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 354 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 160 IncrementalHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 334 mSDtfsCounter, 160 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 521 GetRequests, 508 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 996 NumberOfCodeBlocks, 996 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 823 ConstructedInterpolants, 0 QuantifiedInterpolants, 1289 SizeOfPredicates, 1 NumberOfNonLiveVariables, 395 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 5928/6000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:20:29,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.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 c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:20:31,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:20:31,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:20:31,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:20:31,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:20:31,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:20:31,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:20:31,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:20:31,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:20:31,125 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:20:31,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:20:31,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:20:31,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:20:31,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:20:31,126 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:20:31,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:20:31,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:20:31,127 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:20:31,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:20:31,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:20:31,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:20:31,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:20:31,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:20:31,132 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:20:31,132 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:20:31,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:20:31,132 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:20:31,132 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:20:31,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:20:31,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:20:31,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:20:31,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:20:31,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:20:31,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:20:31,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:20:31,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:20:31,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:20:31,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:20:31,134 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:20:31,134 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:20:31,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:20:31,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:20:31,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:20:31,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:20:31,137 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 -> c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 [2024-11-08 23:20:31,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:20:31,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:20:31,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:20:31,407 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:20:31,408 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:20:31,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-11-08 23:20:32,718 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:20:32,881 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:20:32,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-11-08 23:20:32,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b8547058/e05be5bea38145e2ba18dbaaa4d006e6/FLAG42a3ef690 [2024-11-08 23:20:33,266 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b8547058/e05be5bea38145e2ba18dbaaa4d006e6 [2024-11-08 23:20:33,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:20:33,268 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:20:33,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:20:33,274 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:20:33,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:20:33,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:20:33" (1/1) ... [2024-11-08 23:20:33,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c146d08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:33, skipping insertion in model container [2024-11-08 23:20:33,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:20:33" (1/1) ... [2024-11-08 23:20:33,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:20:33,451 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_loopvsstraightlinecode_100-1loop_file-48.i[916,929] [2024-11-08 23:20:33,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:20:33,544 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:20:33,557 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_loopvsstraightlinecode_100-1loop_file-48.i[916,929] [2024-11-08 23:20:33,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:20:33,622 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:20:33,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:33 WrapperNode [2024-11-08 23:20:33,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:20:33,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:20:33,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:20:33,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:20:33,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:33" (1/1) ... [2024-11-08 23:20:33,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:33" (1/1) ... [2024-11-08 23:20:33,670 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2024-11-08 23:20:33,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:20:33,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:20:33,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:20:33,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:20:33,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:33" (1/1) ... [2024-11-08 23:20:33,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:33" (1/1) ... [2024-11-08 23:20:33,684 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:33" (1/1) ... [2024-11-08 23:20:33,697 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:20:33,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:33" (1/1) ... [2024-11-08 23:20:33,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:33" (1/1) ... [2024-11-08 23:20:33,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:33" (1/1) ... [2024-11-08 23:20:33,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:33" (1/1) ... [2024-11-08 23:20:33,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:33" (1/1) ... [2024-11-08 23:20:33,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:33" (1/1) ... [2024-11-08 23:20:33,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:20:33,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:20:33,721 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:20:33,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:20:33,722 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:33" (1/1) ... [2024-11-08 23:20:33,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:20:33,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:20:33,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:20:33,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:20:33,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:20:33,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:20:33,783 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:20:33,784 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:20:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:20:33,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:20:33,848 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:20:33,850 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:20:38,921 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-08 23:20:38,921 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:20:38,938 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:20:38,939 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:20:38,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:20:38 BoogieIcfgContainer [2024-11-08 23:20:38,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:20:38,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:20:38,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:20:38,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:20:38,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:20:33" (1/3) ... [2024-11-08 23:20:38,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37725659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:20:38, skipping insertion in model container [2024-11-08 23:20:38,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:33" (2/3) ... [2024-11-08 23:20:38,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37725659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:20:38, skipping insertion in model container [2024-11-08 23:20:38,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:20:38" (3/3) ... [2024-11-08 23:20:38,947 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-11-08 23:20:38,966 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:20:38,966 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:20:39,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:20:39,025 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;@5e6239e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:20:39,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:20:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 23:20:39,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 23:20:39,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:20:39,051 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:20:39,051 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:20:39,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:20:39,058 INFO L85 PathProgramCache]: Analyzing trace with hash -955671759, now seen corresponding path program 1 times [2024-11-08 23:20:39,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:20:39,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446036243] [2024-11-08 23:20:39,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:20:39,072 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:20:39,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:20:39,075 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:20:39,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:20:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:39,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:20:39,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:20:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2024-11-08 23:20:39,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:20:39,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:20:39,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446036243] [2024-11-08 23:20:39,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446036243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:20:39,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:20:39,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:20:39,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332398569] [2024-11-08 23:20:39,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:20:39,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:20:39,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:20:39,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:20:39,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:20:39,571 INFO L87 Difference]: Start difference. First operand has 84 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 23:20:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:20:39,599 INFO L93 Difference]: Finished difference Result 165 states and 280 transitions. [2024-11-08 23:20:39,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:20:39,601 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2024-11-08 23:20:39,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:20:39,606 INFO L225 Difference]: With dead ends: 165 [2024-11-08 23:20:39,607 INFO L226 Difference]: Without dead ends: 80 [2024-11-08 23:20:39,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:20:39,612 INFO L432 NwaCegarLoop]: 126 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, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:20:39,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:20:39,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-08 23:20:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-08 23:20:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 23:20:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2024-11-08 23:20:39,648 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 165 [2024-11-08 23:20:39,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:20:39,649 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2024-11-08 23:20:39,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 23:20:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2024-11-08 23:20:39,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 23:20:39,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:20:39,652 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:20:39,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 23:20:39,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:20:39,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:20:39,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:20:39,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1513896379, now seen corresponding path program 1 times [2024-11-08 23:20:39,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:20:39,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295282317] [2024-11-08 23:20:39,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:20:39,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:20:39,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:20:39,857 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:20:39,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:20:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:40,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:20:40,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:20:41,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 23:20:41,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:20:41,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:20:41,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295282317] [2024-11-08 23:20:41,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295282317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:20:41,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:20:41,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:20:41,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239256798] [2024-11-08 23:20:41,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:20:41,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:20:41,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:20:41,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:20:41,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:20:41,500 INFO L87 Difference]: Start difference. First operand 80 states and 122 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 23:20:45,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:20:49,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:20:54,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:20:58,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:20:58,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:20:58,466 INFO L93 Difference]: Finished difference Result 235 states and 361 transitions. [2024-11-08 23:20:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:20:58,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2024-11-08 23:20:58,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:20:58,507 INFO L225 Difference]: With dead ends: 235 [2024-11-08 23:20:58,507 INFO L226 Difference]: Without dead ends: 158 [2024-11-08 23:20:58,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:20:58,509 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 88 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 51 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2024-11-08 23:20:58,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 459 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 20 Invalid, 4 Unknown, 0 Unchecked, 16.9s Time] [2024-11-08 23:20:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-08 23:20:58,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 126. [2024-11-08 23:20:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 73 states have internal predecessors, (92), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 23:20:58,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 192 transitions. [2024-11-08 23:20:58,540 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 192 transitions. Word has length 165 [2024-11-08 23:20:58,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:20:58,540 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 192 transitions. [2024-11-08 23:20:58,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 23:20:58,541 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 192 transitions. [2024-11-08 23:20:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 23:20:58,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:20:58,545 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:20:58,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:20:58,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:20:58,745 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:20:58,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:20:58,746 INFO L85 PathProgramCache]: Analyzing trace with hash 958737469, now seen corresponding path program 1 times [2024-11-08 23:20:58,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:20:58,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384071731] [2024-11-08 23:20:58,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:20:58,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:20:58,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:20:58,766 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:20:58,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 23:20:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:59,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:20:59,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:20:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 568 proven. 24 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2024-11-08 23:20:59,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:21:00,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 23:21:00,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:21:00,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384071731] [2024-11-08 23:21:00,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384071731] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:21:00,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:21:00,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-08 23:21:00,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023111971] [2024-11-08 23:21:00,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:21:00,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:21:00,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:21:00,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:21:00,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:21:00,502 INFO L87 Difference]: Start difference. First operand 126 states and 192 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-08 23:21:05,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:21:06,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:21:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:21:06,641 INFO L93 Difference]: Finished difference Result 219 states and 325 transitions. [2024-11-08 23:21:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:21:06,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 166 [2024-11-08 23:21:06,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:21:06,689 INFO L225 Difference]: With dead ends: 219 [2024-11-08 23:21:06,689 INFO L226 Difference]: Without dead ends: 142 [2024-11-08 23:21:06,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 324 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:21:06,691 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 75 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:21:06,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 218 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 138 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2024-11-08 23:21:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-08 23:21:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2024-11-08 23:21:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 79 states have internal predecessors, (97), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 23:21:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 197 transitions. [2024-11-08 23:21:06,716 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 197 transitions. Word has length 166 [2024-11-08 23:21:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:21:06,717 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 197 transitions. [2024-11-08 23:21:06,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-08 23:21:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 197 transitions. [2024-11-08 23:21:06,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 23:21:06,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:21:06,722 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:21:06,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 23:21:06,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:21:06,923 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:21:06,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:21:06,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1984475090, now seen corresponding path program 1 times [2024-11-08 23:21:06,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:21:06,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920366358] [2024-11-08 23:21:06,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:21:06,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:21:06,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:21:06,927 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:21:06,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 23:21:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:21:07,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-08 23:21:07,817 INFO L278 TraceCheckSpWp]: Computing forward predicates...