./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_50-while_file-60.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 ad157bb59ab2340bd84ae4f3e0fc67d889cafb8dcb0637d5b8ca503c84568a53 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:59:42,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:59:42,312 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:59:42,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:59:42,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:59:42,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:59:42,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:59:42,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:59:42,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:59:42,350 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:59:42,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:59:42,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:59:42,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:59:42,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:59:42,354 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:59:42,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:59:42,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:59:42,355 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:59:42,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:59:42,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:59:42,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:59:42,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:59:42,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:59:42,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:59:42,360 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:59:42,361 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:59:42,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:59:42,361 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:59:42,361 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:59:42,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:59:42,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:59:42,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:59:42,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:59:42,362 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:59:42,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:59:42,363 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:59:42,363 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:59:42,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:59:42,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:59:42,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:59:42,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:59:42,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:59:42,365 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 -> ad157bb59ab2340bd84ae4f3e0fc67d889cafb8dcb0637d5b8ca503c84568a53 [2024-11-10 07:59:42,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:59:42,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:59:42,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:59:42,658 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:59:42,659 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:59:42,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-60.i [2024-11-10 07:59:44,175 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:59:44,371 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:59:44,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-60.i [2024-11-10 07:59:44,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/124c52955/ff1894b5f0824a6fbd5f29474c6e157b/FLAGb00ed5b5e [2024-11-10 07:59:44,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/124c52955/ff1894b5f0824a6fbd5f29474c6e157b [2024-11-10 07:59:44,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:59:44,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:59:44,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:59:44,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:59:44,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:59:44,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:59:44" (1/1) ... [2024-11-10 07:59:44,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714e03cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:44, skipping insertion in model container [2024-11-10 07:59:44,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:59:44" (1/1) ... [2024-11-10 07:59:44,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:59:44,940 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_50-while_file-60.i[915,928] [2024-11-10 07:59:45,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:59:45,022 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:59:45,032 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_50-while_file-60.i[915,928] [2024-11-10 07:59:45,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:59:45,161 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:59:45,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:45 WrapperNode [2024-11-10 07:59:45,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:59:45,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:59:45,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:59:45,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:59:45,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:45" (1/1) ... [2024-11-10 07:59:45,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:45" (1/1) ... [2024-11-10 07:59:45,211 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-11-10 07:59:45,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:59:45,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:59:45,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:59:45,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:59:45,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:45" (1/1) ... [2024-11-10 07:59:45,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:45" (1/1) ... [2024-11-10 07:59:45,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:45" (1/1) ... [2024-11-10 07:59:45,253 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-10 07:59:45,254 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:45" (1/1) ... [2024-11-10 07:59:45,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:45" (1/1) ... [2024-11-10 07:59:45,261 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:45" (1/1) ... [2024-11-10 07:59:45,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:45" (1/1) ... [2024-11-10 07:59:45,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:45" (1/1) ... [2024-11-10 07:59:45,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:45" (1/1) ... [2024-11-10 07:59:45,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:59:45,273 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:59:45,273 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:59:45,273 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:59:45,274 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:45" (1/1) ... [2024-11-10 07:59:45,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:59:45,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:59:45,315 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-10 07:59:45,320 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-10 07:59:45,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:59:45,370 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:59:45,371 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:59:45,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:59:45,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:59:45,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:59:45,448 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:59:45,451 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:59:45,799 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 07:59:45,800 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:59:45,812 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:59:45,813 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:59:45,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:59:45 BoogieIcfgContainer [2024-11-10 07:59:45,813 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:59:45,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:59:45,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:59:45,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:59:45,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:59:44" (1/3) ... [2024-11-10 07:59:45,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1736989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:59:45, skipping insertion in model container [2024-11-10 07:59:45,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:45" (2/3) ... [2024-11-10 07:59:45,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1736989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:59:45, skipping insertion in model container [2024-11-10 07:59:45,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:59:45" (3/3) ... [2024-11-10 07:59:45,822 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-60.i [2024-11-10 07:59:45,837 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:59:45,837 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:59:45,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:59:45,907 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;@320a8dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:59:45,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:59:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 07:59:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 07:59:45,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:59:45,922 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:59:45,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:59:45,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:59:45,927 INFO L85 PathProgramCache]: Analyzing trace with hash 988600183, now seen corresponding path program 1 times [2024-11-10 07:59:45,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:59:45,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366448214] [2024-11-10 07:59:45,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:59:45,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:59:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:59:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:59:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:59:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:59:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:59:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:59:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:59:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:59:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:59:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:59:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:59:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:59:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:59:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:59:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:59:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:59:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:59:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:59:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:59:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:59:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:59:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 07:59:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:59:46,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:59:46,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366448214] [2024-11-10 07:59:46,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366448214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:59:46,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:59:46,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:59:46,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986075610] [2024-11-10 07:59:46,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:59:46,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:59:46,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:59:46,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:59:46,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:59:46,413 INFO L87 Difference]: Start difference. First operand has 69 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 07:59:46,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:59:46,449 INFO L93 Difference]: Finished difference Result 130 states and 223 transitions. [2024-11-10 07:59:46,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:59:46,452 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2024-11-10 07:59:46,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:59:46,460 INFO L225 Difference]: With dead ends: 130 [2024-11-10 07:59:46,460 INFO L226 Difference]: Without dead ends: 64 [2024-11-10 07:59:46,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-10 07:59:46,469 INFO L432 NwaCegarLoop]: 95 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, 95 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-10 07:59:46,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:59:46,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-10 07:59:46,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-10 07:59:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 07:59:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2024-11-10 07:59:46,513 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 141 [2024-11-10 07:59:46,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:59:46,515 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2024-11-10 07:59:46,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 07:59:46,516 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2024-11-10 07:59:46,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 07:59:46,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:59:46,519 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:59:46,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:59:46,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:59:46,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:59:46,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1344691877, now seen corresponding path program 1 times [2024-11-10 07:59:46,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:59:46,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888314678] [2024-11-10 07:59:46,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:59:46,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:59:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:59:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:59:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:59:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:59:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:59:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:59:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:59:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:59:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:59:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:59:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:59:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:59:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:59:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:59:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:59:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:59:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:59:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:59:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:59:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:59:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:59:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 07:59:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:59:46,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:59:46,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888314678] [2024-11-10 07:59:46,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888314678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:59:46,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:59:46,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:59:46,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602048105] [2024-11-10 07:59:46,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:59:46,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:59:46,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:59:46,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:59:46,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:59:46,876 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:59:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:59:46,941 INFO L93 Difference]: Finished difference Result 162 states and 240 transitions. [2024-11-10 07:59:46,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:59:46,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-11-10 07:59:46,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:59:46,946 INFO L225 Difference]: With dead ends: 162 [2024-11-10 07:59:46,949 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 07:59:46,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:59:46,951 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 52 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:59:46,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 215 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:59:46,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 07:59:46,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-11-10 07:59:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 07:59:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2024-11-10 07:59:46,983 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 141 [2024-11-10 07:59:46,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:59:46,984 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2024-11-10 07:59:46,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:59:46,984 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2024-11-10 07:59:46,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-10 07:59:46,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:59:46,986 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:59:46,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:59:46,986 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:59:46,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:59:46,989 INFO L85 PathProgramCache]: Analyzing trace with hash -442171761, now seen corresponding path program 1 times [2024-11-10 07:59:46,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:59:46,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106342052] [2024-11-10 07:59:46,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:59:46,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:59:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:59:47,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2033525548] [2024-11-10 07:59:47,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:59:47,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:59:47,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:59:47,124 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-10 07:59:47,127 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-10 07:59:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:47,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 07:59:47,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:59:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 471 proven. 36 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2024-11-10 07:59:48,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:59:49,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:59:49,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106342052] [2024-11-10 07:59:49,057 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 07:59:49,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033525548] [2024-11-10 07:59:49,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033525548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:59:49,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 07:59:49,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-10 07:59:49,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269509984] [2024-11-10 07:59:49,059 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 07:59:49,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 07:59:49,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:59:49,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 07:59:49,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:59:49,061 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 07:59:49,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:59:49,502 INFO L93 Difference]: Finished difference Result 273 states and 402 transitions. [2024-11-10 07:59:49,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 07:59:49,502 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 142 [2024-11-10 07:59:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:59:49,506 INFO L225 Difference]: With dead ends: 273 [2024-11-10 07:59:49,506 INFO L226 Difference]: Without dead ends: 179 [2024-11-10 07:59:49,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2024-11-10 07:59:49,509 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 73 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:59:49,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 426 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:59:49,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-10 07:59:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 147. [2024-11-10 07:59:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 86 states have (on average 1.2093023255813953) internal successors, (104), 87 states have internal predecessors, (104), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-10 07:59:49,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 216 transitions. [2024-11-10 07:59:49,539 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 216 transitions. Word has length 142 [2024-11-10 07:59:49,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:59:49,540 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 216 transitions. [2024-11-10 07:59:49,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 07:59:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 216 transitions. [2024-11-10 07:59:49,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-10 07:59:49,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:59:49,543 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:59:49,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 07:59:49,747 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-10 07:59:49,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:59:49,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:59:49,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2055844176, now seen corresponding path program 1 times [2024-11-10 07:59:49,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:59:49,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773599450] [2024-11-10 07:59:49,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:59:49,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:59:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:59:49,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [643590029] [2024-11-10 07:59:49,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:59:49,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:59:49,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:59:49,856 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-10 07:59:49,858 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-10 07:59:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:59:50,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:59:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:59:50,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:59:50,293 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:59:50,294 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:59:50,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 07:59:50,496 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-10 07:59:50,500 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 07:59:50,622 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:59:50,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:59:50 BoogieIcfgContainer [2024-11-10 07:59:50,625 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:59:50,626 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:59:50,626 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:59:50,626 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:59:50,627 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:59:45" (3/4) ... [2024-11-10 07:59:50,629 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:59:50,630 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:59:50,631 INFO L158 Benchmark]: Toolchain (without parser) took 5881.52ms. Allocated memory was 161.5MB in the beginning and 205.5MB in the end (delta: 44.0MB). Free memory was 92.9MB in the beginning and 166.5MB in the end (delta: -73.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:59:50,631 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:59:50,631 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.88ms. Allocated memory is still 161.5MB. Free memory was 92.8MB in the beginning and 132.3MB in the end (delta: -39.6MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-11-10 07:59:50,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.87ms. Allocated memory is still 161.5MB. Free memory was 132.3MB in the beginning and 129.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 07:59:50,632 INFO L158 Benchmark]: Boogie Preprocessor took 59.83ms. Allocated memory is still 161.5MB. Free memory was 129.7MB in the beginning and 126.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:59:50,632 INFO L158 Benchmark]: IcfgBuilder took 540.38ms. Allocated memory is still 161.5MB. Free memory was 126.1MB in the beginning and 106.0MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 07:59:50,633 INFO L158 Benchmark]: TraceAbstraction took 4810.30ms. Allocated memory was 161.5MB in the beginning and 205.5MB in the end (delta: 44.0MB). Free memory was 105.8MB in the beginning and 166.5MB in the end (delta: -60.7MB). Peak memory consumption was 82.8MB. Max. memory is 16.1GB. [2024-11-10 07:59:50,633 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 205.5MB. Free memory is still 166.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:59:50,634 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.19ms. Allocated memory is still 109.1MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.88ms. Allocated memory is still 161.5MB. Free memory was 92.8MB in the beginning and 132.3MB in the end (delta: -39.6MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.87ms. Allocated memory is still 161.5MB. Free memory was 132.3MB in the beginning and 129.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.83ms. Allocated memory is still 161.5MB. Free memory was 129.7MB in the beginning and 126.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 540.38ms. Allocated memory is still 161.5MB. Free memory was 126.1MB in the beginning and 106.0MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4810.30ms. Allocated memory was 161.5MB in the beginning and 205.5MB in the end (delta: 44.0MB). Free memory was 105.8MB in the beginning and 166.5MB in the end (delta: -60.7MB). Peak memory consumption was 82.8MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 205.5MB. Free memory is still 166.5MB. 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 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 141. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 32; [L23] unsigned char var_1_2 = 1; [L24] float var_1_4 = 7.8; [L25] signed short int var_1_6 = 16; [L26] signed short int var_1_7 = 256; [L27] float var_1_8 = 256.6; [L28] unsigned char var_1_9 = 50; [L29] unsigned char var_1_10 = 5; [L30] double var_1_11 = 127.75; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_13 = 1; [L33] unsigned char var_1_14 = 0; [L34] double var_1_15 = 15.2; [L35] double var_1_16 = 256.5; [L36] double var_1_17 = 256.5; [L37] double var_1_18 = 0.0; [L38] double var_1_19 = 9.7; [L39] unsigned long int var_1_20 = 10000000; [L40] unsigned long int var_1_21 = 4008920074; [L41] signed short int last_1_var_1_1 = 32; [L42] unsigned char last_1_var_1_9 = 50; [L43] double last_1_var_1_11 = 127.75; [L44] double last_1_var_1_16 = 256.5; [L45] unsigned long int last_1_var_1_20 = 10000000; VAL [isInitial=0, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=1, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L145] isInitial = 1 [L146] FCALL initially() [L147] COND TRUE 1 [L148] CALL updateLastVariables() [L134] last_1_var_1_1 = var_1_1 [L135] last_1_var_1_9 = var_1_9 [L136] last_1_var_1_11 = var_1_11 [L137] last_1_var_1_16 = var_1_16 [L138] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=1, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L148] RET updateLastVariables() [L149] CALL updateVariables() [L97] var_1_2 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L98] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L99] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L99] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L100] var_1_4 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L101] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L102] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L102] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L103] var_1_6 = __VERIFIER_nondet_short() [L104] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L104] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L105] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L105] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L106] var_1_7 = __VERIFIER_nondet_short() [L107] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L107] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L108] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L108] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L109] var_1_10 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L110] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L111] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L111] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L112] var_1_12 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L113] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L114] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L114] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L115] var_1_13 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L116] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L117] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L117] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L118] var_1_14 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L119] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L120] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L120] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L121] var_1_15 = __VERIFIER_nondet_double() [L122] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L122] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L123] var_1_17 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L124] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L125] var_1_18 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L126] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L127] var_1_19 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L128] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L129] var_1_21 = __VERIFIER_nondet_ulong() [L130] CALL assume_abort_if_not(var_1_21 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=6442450943, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=6442450943, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L130] RET assume_abort_if_not(var_1_21 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=6442450943, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L131] CALL assume_abort_if_not(var_1_21 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=6442450943, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=6442450943, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L131] RET assume_abort_if_not(var_1_21 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=6442450943, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L149] RET updateVariables() [L150] CALL step() [L49] signed long int stepLocal_0 = (((var_1_7) < (last_1_var_1_1)) ? (var_1_7) : (last_1_var_1_1)); VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=6442450943, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L50] COND FALSE !(last_1_var_1_11 < (last_1_var_1_11 + last_1_var_1_16)) [L57] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=6442450943, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L59] unsigned long int stepLocal_1 = last_1_var_1_20; VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, stepLocal_1=10000000, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=6442450943, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L60] COND FALSE !(((var_1_10 * last_1_var_1_9) + last_1_var_1_1) > stepLocal_1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=6442450943, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L63] COND FALSE !((last_1_var_1_16 >= last_1_var_1_16) || ((var_1_2 && var_1_12) || (var_1_13 || var_1_14))) [L70] var_1_11 = var_1_15 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=6442450943, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L72] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=6442450943, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L75] COND TRUE var_1_9 >= var_1_9 [L76] var_1_20 = (var_1_21 - var_1_9) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=6442450941, var_1_21=6442450943, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L81] COND FALSE !((- var_1_16) <= var_1_4) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=6442450941, var_1_21=6442450943, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L86] COND FALSE !(\read(var_1_2)) [L93] var_1_1 = var_1_9 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=6442450941, var_1_21=6442450943, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L150] RET step() [L151] CALL, EXPR property() [L141-L142] return (((((var_1_2 ? (((var_1_11 / var_1_4) <= var_1_8) ? (var_1_1 == ((signed short int) (var_1_9 - var_1_9))) : (var_1_1 == ((signed short int) var_1_9))) : (var_1_1 == ((signed short int) var_1_9))) && (((- var_1_16) <= var_1_4) ? (((var_1_11 <= var_1_4) || var_1_2) ? (var_1_8 == ((float) 3.3f)) : 1) : 1)) && ((last_1_var_1_11 < (last_1_var_1_11 + last_1_var_1_16)) ? ((((((var_1_7) < (last_1_var_1_1)) ? (var_1_7) : (last_1_var_1_1))) > (var_1_6 * 1)) ? (var_1_9 == ((unsigned char) var_1_10)) : (var_1_9 == ((unsigned char) var_1_10))) : (var_1_9 == ((unsigned char) var_1_10)))) && (((last_1_var_1_16 >= last_1_var_1_16) || ((var_1_2 && var_1_12) || (var_1_13 || var_1_14))) ? (var_1_2 ? (var_1_11 == ((double) var_1_15)) : (var_1_11 == ((double) var_1_15))) : (var_1_11 == ((double) var_1_15)))) && ((((var_1_10 * last_1_var_1_9) + last_1_var_1_1) > last_1_var_1_20) ? (var_1_16 == ((double) (var_1_17 - (var_1_18 - var_1_19)))) : 1)) && (var_1_13 ? (var_1_20 == ((unsigned long int) (((((var_1_9) > (128u)) ? (var_1_9) : (128u))) + var_1_9))) : ((var_1_9 >= var_1_9) ? (var_1_20 == ((unsigned long int) (var_1_21 - var_1_9))) : (var_1_20 == ((unsigned long int) var_1_9)))) ; VAL [\result=0, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=6442450941, var_1_21=6442450943, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L151] RET, EXPR property() [L151] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=6442450941, var_1_21=6442450943, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=6442450941, var_1_21=6442450943, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 4, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 125 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 125 mSDsluCounter, 736 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 449 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 231 IncrementalHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 287 mSDtfsCounter, 231 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=3, InterpolantAutomatonStates: 17, 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, 36 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 850 NumberOfCodeBlocks, 850 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 421 ConstructedInterpolants, 0 QuantifiedInterpolants, 1582 SizeOfPredicates, 6 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2736/2772 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-10 07:59:50,659 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_50-while_file-60.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 ad157bb59ab2340bd84ae4f3e0fc67d889cafb8dcb0637d5b8ca503c84568a53 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:59:52,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:59:52,951 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:59:52,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:59:52,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:59:52,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:59:52,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:59:52,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:59:52,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:59:52,997 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:59:52,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:59:52,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:59:52,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:59:52,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:59:52,998 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:59:52,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:59:52,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:59:52,999 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:59:52,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:59:52,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:59:52,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:59:53,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:59:53,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:59:53,001 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:59:53,001 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:59:53,001 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:59:53,002 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:59:53,002 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:59:53,002 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:59:53,002 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:59:53,003 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:59:53,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:59:53,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:59:53,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:59:53,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:59:53,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:59:53,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:59:53,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:59:53,005 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:59:53,005 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:59:53,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:59:53,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:59:53,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:59:53,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:59:53,006 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 -> ad157bb59ab2340bd84ae4f3e0fc67d889cafb8dcb0637d5b8ca503c84568a53 [2024-11-10 07:59:53,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:59:53,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:59:53,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:59:53,384 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:59:53,384 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:59:53,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-60.i [2024-11-10 07:59:55,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:59:55,222 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:59:55,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-60.i [2024-11-10 07:59:55,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1adc62f3b/aab4bfbc972d4525aa1f221028d412bc/FLAG8f4def8fb [2024-11-10 07:59:55,247 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1adc62f3b/aab4bfbc972d4525aa1f221028d412bc [2024-11-10 07:59:55,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:59:55,250 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:59:55,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:59:55,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:59:55,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:59:55,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:59:55" (1/1) ... [2024-11-10 07:59:55,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50fe42d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:55, skipping insertion in model container [2024-11-10 07:59:55,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:59:55" (1/1) ... [2024-11-10 07:59:55,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:59:55,485 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_50-while_file-60.i[915,928] [2024-11-10 07:59:55,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:59:55,600 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:59:55,613 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_50-while_file-60.i[915,928] [2024-11-10 07:59:55,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:59:55,679 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:59:55,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:55 WrapperNode [2024-11-10 07:59:55,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:59:55,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:59:55,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:59:55,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:59:55,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:55" (1/1) ... [2024-11-10 07:59:55,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:55" (1/1) ... [2024-11-10 07:59:55,739 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2024-11-10 07:59:55,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:59:55,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:59:55,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:59:55,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:59:55,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:55" (1/1) ... [2024-11-10 07:59:55,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:55" (1/1) ... [2024-11-10 07:59:55,765 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:55" (1/1) ... [2024-11-10 07:59:55,788 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-10 07:59:55,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:55" (1/1) ... [2024-11-10 07:59:55,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:55" (1/1) ... [2024-11-10 07:59:55,801 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:55" (1/1) ... [2024-11-10 07:59:55,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:55" (1/1) ... [2024-11-10 07:59:55,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:55" (1/1) ... [2024-11-10 07:59:55,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:55" (1/1) ... [2024-11-10 07:59:55,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:59:55,820 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:59:55,820 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:59:55,820 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:59:55,821 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:55" (1/1) ... [2024-11-10 07:59:55,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:59:55,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:59:55,858 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-10 07:59:55,865 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-10 07:59:55,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:59:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:59:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:59:55,906 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:59:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:59:55,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:59:56,004 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:59:56,008 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:00:10,878 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 08:00:10,879 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:00:10,897 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:00:10,897 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:00:10,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:00:10 BoogieIcfgContainer [2024-11-10 08:00:10,898 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:00:10,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:00:10,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:00:10,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:00:10,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:59:55" (1/3) ... [2024-11-10 08:00:10,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c48f2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:00:10, skipping insertion in model container [2024-11-10 08:00:10,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:55" (2/3) ... [2024-11-10 08:00:10,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c48f2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:00:10, skipping insertion in model container [2024-11-10 08:00:10,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:00:10" (3/3) ... [2024-11-10 08:00:10,908 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-60.i [2024-11-10 08:00:10,928 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:00:10,928 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:00:10,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:00:11,004 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;@bd0e5ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:00:11,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:00:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 08:00:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 08:00:11,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:00:11,021 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:00:11,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:00:11,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:00:11,026 INFO L85 PathProgramCache]: Analyzing trace with hash 988600183, now seen corresponding path program 1 times [2024-11-10 08:00:11,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:00:11,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746038736] [2024-11-10 08:00:11,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:00:11,039 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-10 08:00:11,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:00:11,042 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-10 08:00:11,044 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-10 08:00:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:00:12,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 08:00:12,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:00:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2024-11-10 08:00:12,214 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:00:12,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:00:12,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746038736] [2024-11-10 08:00:12,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746038736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:00:12,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:00:12,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:00:12,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949465178] [2024-11-10 08:00:12,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:00:12,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:00:12,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:00:12,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:00:12,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:00:12,260 INFO L87 Difference]: Start difference. First operand has 69 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 08:00:12,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:00:12,305 INFO L93 Difference]: Finished difference Result 130 states and 223 transitions. [2024-11-10 08:00:12,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:00:12,308 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2024-11-10 08:00:12,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:00:12,317 INFO L225 Difference]: With dead ends: 130 [2024-11-10 08:00:12,318 INFO L226 Difference]: Without dead ends: 64 [2024-11-10 08:00:12,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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-10 08:00:12,329 INFO L432 NwaCegarLoop]: 95 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, 95 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-10 08:00:12,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:00:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-10 08:00:12,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-10 08:00:12,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 08:00:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2024-11-10 08:00:12,395 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 141 [2024-11-10 08:00:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:00:12,397 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2024-11-10 08:00:12,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 08:00:12,398 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2024-11-10 08:00:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 08:00:12,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:00:12,404 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:00:12,448 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 (2)] Forceful destruction successful, exit code 0 [2024-11-10 08:00:12,605 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-10 08:00:12,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:00:12,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:00:12,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1344691877, now seen corresponding path program 1 times [2024-11-10 08:00:12,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:00:12,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085496879] [2024-11-10 08:00:12,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:00:12,608 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-10 08:00:12,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:00:12,610 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-10 08:00:12,611 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-10 08:00:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:00:13,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 08:00:13,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:00:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 08:00:24,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:00:24,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:00:24,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085496879] [2024-11-10 08:00:24,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085496879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:00:24,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:00:24,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:00:24,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022021127] [2024-11-10 08:00:24,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:00:24,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:00:24,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:00:24,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:00:24,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:00:24,178 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 08:00:25,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:00:30,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:00:34,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:00:39,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:00:43,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:00:47,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:00:51,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:00:57,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:01:01,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:01:06,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:01:10,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:01:14,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:01:18,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:01:18,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:01:18,483 INFO L93 Difference]: Finished difference Result 190 states and 285 transitions. [2024-11-10 08:01:18,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 08:01:18,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-11-10 08:01:18,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:01:18,588 INFO L225 Difference]: With dead ends: 190 [2024-11-10 08:01:18,588 INFO L226 Difference]: Without dead ends: 129 [2024-11-10 08:01:18,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:01:18,590 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 55 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 46 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:01:18,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 230 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 48 Invalid, 12 Unknown, 0 Unchecked, 54.1s Time] [2024-11-10 08:01:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-10 08:01:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2024-11-10 08:01:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 64 states have (on average 1.203125) internal successors, (77), 64 states have internal predecessors, (77), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-10 08:01:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 165 transitions. [2024-11-10 08:01:18,623 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 165 transitions. Word has length 141 [2024-11-10 08:01:18,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:01:18,624 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 165 transitions. [2024-11-10 08:01:18,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 08:01:18,624 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 165 transitions. [2024-11-10 08:01:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 08:01:18,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:01:18,627 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:01:18,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 08:01:18,827 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-10 08:01:18,828 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:01:18,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:01:18,829 INFO L85 PathProgramCache]: Analyzing trace with hash -602447912, now seen corresponding path program 1 times [2024-11-10 08:01:18,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:01:18,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726258467] [2024-11-10 08:01:18,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:01:18,830 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-10 08:01:18,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:01:18,833 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-10 08:01:18,835 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-10 08:01:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:01:19,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 08:01:19,845 INFO L278 TraceCheckSpWp]: Computing forward predicates...