./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-26.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c25e21c50fc3f19586705dbabc58d5e825823fcb59fbd002ae657c0fa41f3444 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:46:49,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:46:49,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:46:49,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:46:49,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:46:49,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:46:49,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:46:49,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:46:49,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:46:49,965 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:46:49,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:46:49,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:46:49,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:46:49,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:46:49,970 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:46:49,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:46:49,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:46:49,971 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:46:49,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:46:49,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:46:49,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:46:49,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:46:49,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:46:49,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:46:49,974 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:46:49,974 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:46:49,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:46:49,975 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:46:49,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:46:49,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:46:49,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:46:49,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:46:49,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:46:49,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:46:49,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:46:49,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:46:49,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:46:49,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:46:49,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:46:49,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:46:49,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:46:49,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:46:49,979 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-clean/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-clean/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 -> c25e21c50fc3f19586705dbabc58d5e825823fcb59fbd002ae657c0fa41f3444 [2024-10-11 11:46:50,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:46:50,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:46:50,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:46:50,231 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:46:50,232 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:46:50,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-26.i [2024-10-11 11:46:51,610 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:46:51,809 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:46:51,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-26.i [2024-10-11 11:46:51,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9f3928396/cbcc2642d55a417989601f6b8d609785/FLAG5f1d125b0 [2024-10-11 11:46:52,187 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9f3928396/cbcc2642d55a417989601f6b8d609785 [2024-10-11 11:46:52,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:46:52,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:46:52,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:46:52,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:46:52,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:46:52,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:46:52" (1/1) ... [2024-10-11 11:46:52,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707a2a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:46:52, skipping insertion in model container [2024-10-11 11:46:52,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:46:52" (1/1) ... [2024-10-11 11:46:52,221 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:46:52,386 WARN L248 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-1loop_file-26.i[915,928] [2024-10-11 11:46:52,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:46:52,471 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:46:52,484 WARN L248 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-1loop_file-26.i[915,928] [2024-10-11 11:46:52,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:46:52,526 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:46:52,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:46:52 WrapperNode [2024-10-11 11:46:52,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:46:52,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:46:52,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:46:52,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:46:52,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:46:52" (1/1) ... [2024-10-11 11:46:52,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:46:52" (1/1) ... [2024-10-11 11:46:52,597 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-10-11 11:46:52,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:46:52,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:46:52,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:46:52,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:46:52,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:46:52" (1/1) ... [2024-10-11 11:46:52,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:46:52" (1/1) ... [2024-10-11 11:46:52,629 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:46:52" (1/1) ... [2024-10-11 11:46:52,645 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-10-11 11:46:52,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:46:52" (1/1) ... [2024-10-11 11:46:52,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:46:52" (1/1) ... [2024-10-11 11:46:52,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:46:52" (1/1) ... [2024-10-11 11:46:52,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:46:52" (1/1) ... [2024-10-11 11:46:52,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:46:52" (1/1) ... [2024-10-11 11:46:52,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:46:52" (1/1) ... [2024-10-11 11:46:52,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:46:52,665 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:46:52,666 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:46:52,666 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:46:52,672 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:46:52" (1/1) ... [2024-10-11 11:46:52,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:46:52,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:46:52,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:46:52,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:46:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:46:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:46:52,752 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:46:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:46:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:46:52,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:46:52,829 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:46:52,832 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:46:53,110 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-11 11:46:53,111 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:46:53,144 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:46:53,144 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:46:53,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:46:53 BoogieIcfgContainer [2024-10-11 11:46:53,144 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:46:53,146 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:46:53,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:46:53,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:46:53,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:46:52" (1/3) ... [2024-10-11 11:46:53,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad766f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:46:53, skipping insertion in model container [2024-10-11 11:46:53,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:46:52" (2/3) ... [2024-10-11 11:46:53,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad766f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:46:53, skipping insertion in model container [2024-10-11 11:46:53,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:46:53" (3/3) ... [2024-10-11 11:46:53,158 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-26.i [2024-10-11 11:46:53,173 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:46:53,173 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:46:53,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:46:53,238 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;@66ce531f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:46:53,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:46:53,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 11:46:53,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 11:46:53,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:46:53,254 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 11:46:53,254 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:46:53,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:46:53,263 INFO L85 PathProgramCache]: Analyzing trace with hash 628465278, now seen corresponding path program 1 times [2024-10-11 11:46:53,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:46:53,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681934708] [2024-10-11 11:46:53,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:46:53,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:46:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:53,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:46:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:53,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:46:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:53,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:46:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:53,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:46:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:53,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:46:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:53,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:46:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:53,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:46:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:53,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:46:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:53,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:46:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:53,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:46:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:53,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:46:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:53,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:46:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:53,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:46:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:53,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:46:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:53,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:46:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:53,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:46:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:53,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:46:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:53,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:46:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 11:46:53,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:46:53,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681934708] [2024-10-11 11:46:53,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681934708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:46:53,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:46:53,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:46:53,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589388750] [2024-10-11 11:46:53,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:46:53,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:46:53,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:46:53,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:46:53,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:46:53,728 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 11:46:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:46:53,777 INFO L93 Difference]: Finished difference Result 107 states and 185 transitions. [2024-10-11 11:46:53,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:46:53,780 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2024-10-11 11:46:53,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:46:53,810 INFO L225 Difference]: With dead ends: 107 [2024-10-11 11:46:53,810 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 11:46:53,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-10-11 11:46:53,824 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:46:53,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:46:53,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 11:46:53,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 11:46:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 11:46:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 79 transitions. [2024-10-11 11:46:53,905 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 79 transitions. Word has length 114 [2024-10-11 11:46:53,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:46:53,907 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 79 transitions. [2024-10-11 11:46:53,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 11:46:53,907 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 79 transitions. [2024-10-11 11:46:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 11:46:53,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:46:53,914 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 11:46:53,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:46:53,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:46:53,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:46:53,916 INFO L85 PathProgramCache]: Analyzing trace with hash 878126714, now seen corresponding path program 1 times [2024-10-11 11:46:53,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:46:53,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949712882] [2024-10-11 11:46:53,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:46:53,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:46:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:54,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:46:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:54,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:46:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:54,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:46:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:54,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:46:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:54,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:46:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:54,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:46:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:54,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:46:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:54,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:46:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:54,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:46:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:54,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:46:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:54,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:46:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:54,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:46:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:54,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:46:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:54,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:46:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:54,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:46:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:54,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:46:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:54,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:46:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:54,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:46:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:46:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 11:46:54,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:46:54,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949712882] [2024-10-11 11:46:54,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949712882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:46:54,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:46:54,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:46:54,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461001263] [2024-10-11 11:46:54,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:46:54,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:46:54,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:46:54,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:46:54,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:46:54,490 INFO L87 Difference]: Start difference. First operand 52 states and 79 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 11:46:54,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:46:54,644 INFO L93 Difference]: Finished difference Result 128 states and 192 transitions. [2024-10-11 11:46:54,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:46:54,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-10-11 11:46:54,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:46:54,647 INFO L225 Difference]: With dead ends: 128 [2024-10-11 11:46:54,648 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 11:46:54,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:46:54,651 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 32 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:46:54,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 223 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:46:54,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 11:46:54,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2024-10-11 11:46:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.38) internal successors, (69), 51 states have internal predecessors, (69), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:46:54,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 111 transitions. [2024-10-11 11:46:54,672 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 111 transitions. Word has length 114 [2024-10-11 11:46:54,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:46:54,673 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 111 transitions. [2024-10-11 11:46:54,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 11:46:54,673 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 111 transitions. [2024-10-11 11:46:54,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 11:46:54,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:46:54,677 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 11:46:54,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:46:54,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:46:54,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:46:54,678 INFO L85 PathProgramCache]: Analyzing trace with hash 761568818, now seen corresponding path program 1 times [2024-10-11 11:46:54,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:46:54,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41194641] [2024-10-11 11:46:54,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:46:54,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:46:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:46:54,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1236463021] [2024-10-11 11:46:54,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:46:54,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:46:54,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:46:54,793 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:46:54,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:46:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:46:55,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:46:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:46:55,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:46:55,144 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:46:55,145 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:46:55,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:46:55,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:46:55,351 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 11:46:55,431 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:46:55,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:46:55 BoogieIcfgContainer [2024-10-11 11:46:55,438 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:46:55,439 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:46:55,439 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:46:55,439 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:46:55,440 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:46:53" (3/4) ... [2024-10-11 11:46:55,443 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:46:55,444 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:46:55,445 INFO L158 Benchmark]: Toolchain (without parser) took 3252.77ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 76.8MB in the beginning and 111.2MB in the end (delta: -34.4MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-10-11 11:46:55,447 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 100.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:46:55,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.31ms. Allocated memory is still 151.0MB. Free memory was 76.6MB in the beginning and 61.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 11:46:55,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.08ms. Allocated memory is still 151.0MB. Free memory was 61.0MB in the beginning and 117.7MB in the end (delta: -56.6MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-10-11 11:46:55,448 INFO L158 Benchmark]: Boogie Preprocessor took 63.15ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 117.6MB in the beginning and 162.2MB in the end (delta: -44.6MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2024-10-11 11:46:55,448 INFO L158 Benchmark]: RCFGBuilder took 479.09ms. Allocated memory is still 197.1MB. Free memory was 162.2MB in the beginning and 138.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 11:46:55,449 INFO L158 Benchmark]: TraceAbstraction took 2291.79ms. Allocated memory is still 197.1MB. Free memory was 137.1MB in the beginning and 112.3MB in the end (delta: 24.8MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2024-10-11 11:46:55,449 INFO L158 Benchmark]: Witness Printer took 5.08ms. Allocated memory is still 197.1MB. Free memory was 112.3MB in the beginning and 111.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:46:55,450 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.15ms. Allocated memory is still 151.0MB. Free memory is still 100.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.31ms. Allocated memory is still 151.0MB. Free memory was 76.6MB in the beginning and 61.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.08ms. Allocated memory is still 151.0MB. Free memory was 61.0MB in the beginning and 117.7MB in the end (delta: -56.6MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.15ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 117.6MB in the beginning and 162.2MB in the end (delta: -44.6MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * RCFGBuilder took 479.09ms. Allocated memory is still 197.1MB. Free memory was 162.2MB in the beginning and 138.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2291.79ms. Allocated memory is still 197.1MB. Free memory was 137.1MB in the beginning and 112.3MB in the end (delta: 24.8MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * Witness Printer took 5.08ms. Allocated memory is still 197.1MB. Free memory was 112.3MB in the beginning and 111.2MB in the end (delta: 1.0MB). 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 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 133. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 16; [L23] signed long int var_1_4 = -64; [L24] signed char var_1_9 = 10; [L25] unsigned char var_1_10 = 0; [L26] signed char var_1_11 = -1; [L27] unsigned short int var_1_12 = 10000; [L28] float var_1_13 = 5.4; [L29] float var_1_14 = 1.4; [L30] unsigned short int var_1_18 = 32; [L31] double var_1_20 = 1.5; [L32] double var_1_21 = 2.75; [L33] unsigned char var_1_22 = 5; [L34] unsigned short int var_1_23 = 55712; [L35] unsigned char var_1_24 = 5; [L36] signed short int var_1_25 = 10; [L37] float var_1_26 = 64.2; [L38] unsigned long int last_1_var_1_1 = 16; [L39] signed char last_1_var_1_9 = 10; [L40] unsigned short int last_1_var_1_12 = 10000; [L41] double last_1_var_1_20 = 1.5; [L42] unsigned char last_1_var_1_22 = 5; [L43] signed short int last_1_var_1_25 = 10; [L137] isInitial = 1 [L138] FCALL initially() [L139] int k_loop; [L140] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=-64, var_1_9=10] [L140] COND TRUE k_loop < 1 [L141] CALL updateLastVariables() [L125] last_1_var_1_1 = var_1_1 [L126] last_1_var_1_9 = var_1_9 [L127] last_1_var_1_12 = var_1_12 [L128] last_1_var_1_20 = var_1_20 [L129] last_1_var_1_22 = var_1_22 [L130] last_1_var_1_25 = var_1_25 [L141] RET updateLastVariables() [L142] CALL updateVariables() [L95] var_1_4 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L96] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L97] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L97] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L98] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L98] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L99] var_1_10 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L100] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L101] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L101] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L102] var_1_11 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L103] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L104] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L104] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L105] var_1_13 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L106] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L107] var_1_14 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L108] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L109] var_1_18 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L110] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L111] CALL assume_abort_if_not(var_1_18 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L111] RET assume_abort_if_not(var_1_18 <= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L112] var_1_21 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L113] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L114] var_1_23 = __VERIFIER_nondet_ushort() [L115] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L115] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L116] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L116] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L117] var_1_24 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L118] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L119] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L119] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L120] var_1_26 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=10] [L121] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=10] [L122] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=10] [L122] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=10] [L142] RET updateVariables() [L143] CALL step() [L47] COND FALSE !(! var_1_10) [L54] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=7] [L56] unsigned char stepLocal_2 = var_1_10; [L57] signed long int stepLocal_1 = last_1_var_1_22; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_1=5, stepLocal_2=1, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=7] [L58] COND TRUE ((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || stepLocal_2 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_1=5, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=7] [L59] COND FALSE !(stepLocal_1 >= last_1_var_1_12) [L62] var_1_12 = last_1_var_1_22 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=7] [L65] unsigned long int stepLocal_5 = last_1_var_1_1; [L66] signed long int stepLocal_4 = var_1_4 + last_1_var_1_9; [L67] unsigned short int stepLocal_3 = var_1_18; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=14, stepLocal_5=16, var_1_10=1, var_1_11=7, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=7] [L68] COND FALSE !(stepLocal_5 > last_1_var_1_12) [L79] var_1_22 = var_1_24 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=14, var_1_10=1, var_1_11=7, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=7] [L81] COND TRUE var_1_11 > (var_1_22 * (var_1_12 + var_1_22)) [L82] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=14, var_1_10=1, var_1_11=7, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=7] [L84] COND TRUE (var_1_20 / var_1_26) > var_1_13 [L85] var_1_25 = ((((((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) > (2)) ? (((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) : (2))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=14, var_1_10=1, var_1_11=7, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=4, var_1_9=7] [L89] signed long int stepLocal_0 = (var_1_25 + var_1_9) / var_1_4; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_0=2, stepLocal_3=0, stepLocal_4=14, var_1_10=1, var_1_11=7, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=4, var_1_9=7] [L90] COND TRUE stepLocal_0 == var_1_25 [L91] var_1_1 = (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=14, var_1_10=1, var_1_11=7, var_1_12=5, var_1_18=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=4, var_1_9=7] [L143] RET step() [L144] CALL, EXPR property() [L133-L134] return ((((((((var_1_25 + var_1_9) / var_1_4) == var_1_25) ? (var_1_1 == ((unsigned long int) (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22))) : 1) && ((! var_1_10) ? ((((((last_1_var_1_22) > (last_1_var_1_25)) ? (last_1_var_1_22) : (last_1_var_1_25))) >= last_1_var_1_12) ? (var_1_9 == ((signed char) (-16 + var_1_11))) : (var_1_9 == ((signed char) var_1_11))) : (var_1_9 == ((signed char) var_1_11)))) && ((((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || var_1_10) ? ((last_1_var_1_22 >= last_1_var_1_12) ? (var_1_12 == ((unsigned short int) (((((last_1_var_1_22) < (last_1_var_1_22)) ? (last_1_var_1_22) : (last_1_var_1_22))) + 32))) : (var_1_12 == ((unsigned short int) last_1_var_1_22))) : 1)) && ((var_1_11 > (var_1_22 * (var_1_12 + var_1_22))) ? (var_1_20 == ((double) var_1_21)) : 1)) && ((last_1_var_1_1 > last_1_var_1_12) ? ((last_1_var_1_1 >= (var_1_4 + last_1_var_1_9)) ? ((var_1_18 == (var_1_23 - 8)) ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24)))) && (((var_1_20 / var_1_26) > var_1_13) ? (var_1_25 == ((signed short int) ((((((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) > (2)) ? (((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) : (2))))) : (var_1_25 == ((signed short int) var_1_11))) ; [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=5, var_1_18=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=4, var_1_9=7] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=5, var_1_18=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=4, var_1_9=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 299 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 140 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 159 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 458 NumberOfCodeBlocks, 458 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1224/1224 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-10-11 11:46:55,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-26.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c25e21c50fc3f19586705dbabc58d5e825823fcb59fbd002ae657c0fa41f3444 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:46:57,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:46:57,614 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:46:57,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:46:57,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:46:57,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:46:57,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:46:57,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:46:57,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:46:57,656 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:46:57,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:46:57,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:46:57,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:46:57,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:46:57,658 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:46:57,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:46:57,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:46:57,658 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:46:57,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:46:57,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:46:57,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:46:57,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:46:57,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:46:57,662 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:46:57,662 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:46:57,662 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:46:57,662 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:46:57,663 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:46:57,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:46:57,663 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:46:57,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:46:57,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:46:57,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:46:57,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:46:57,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:46:57,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:46:57,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:46:57,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:46:57,667 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:46:57,667 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:46:57,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:46:57,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:46:57,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:46:57,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:46:57,668 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:46:57,668 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-clean/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-clean/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 -> c25e21c50fc3f19586705dbabc58d5e825823fcb59fbd002ae657c0fa41f3444 [2024-10-11 11:46:57,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:46:58,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:46:58,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:46:58,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:46:58,014 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:46:58,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-26.i [2024-10-11 11:46:59,459 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:46:59,652 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:46:59,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-26.i [2024-10-11 11:46:59,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b9d40e823/2536136f8b1942a7a5b38a4010a21394/FLAG7c221a3d2 [2024-10-11 11:47:00,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b9d40e823/2536136f8b1942a7a5b38a4010a21394 [2024-10-11 11:47:00,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:47:00,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:47:00,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:47:00,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:47:00,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:47:00,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:47:00" (1/1) ... [2024-10-11 11:47:00,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6114592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:00, skipping insertion in model container [2024-10-11 11:47:00,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:47:00" (1/1) ... [2024-10-11 11:47:00,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:47:00,228 WARN L248 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-1loop_file-26.i[915,928] [2024-10-11 11:47:00,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:47:00,314 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:47:00,327 WARN L248 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-1loop_file-26.i[915,928] [2024-10-11 11:47:00,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:47:00,391 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:47:00,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:00 WrapperNode [2024-10-11 11:47:00,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:47:00,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:47:00,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:47:00,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:47:00,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:00" (1/1) ... [2024-10-11 11:47:00,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:00" (1/1) ... [2024-10-11 11:47:00,451 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-10-11 11:47:00,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:47:00,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:47:00,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:47:00,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:47:00,465 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:00" (1/1) ... [2024-10-11 11:47:00,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:00" (1/1) ... [2024-10-11 11:47:00,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:00" (1/1) ... [2024-10-11 11:47:00,492 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-10-11 11:47:00,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:00" (1/1) ... [2024-10-11 11:47:00,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:00" (1/1) ... [2024-10-11 11:47:00,505 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:00" (1/1) ... [2024-10-11 11:47:00,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:00" (1/1) ... [2024-10-11 11:47:00,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:00" (1/1) ... [2024-10-11 11:47:00,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:00" (1/1) ... [2024-10-11 11:47:00,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:47:00,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:47:00,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:47:00,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:47:00,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:00" (1/1) ... [2024-10-11 11:47:00,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:47:00,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:47:00,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:47:00,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:47:00,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:47:00,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:47:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:47:00,608 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:47:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:47:00,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:47:00,702 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:47:00,704 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:47:13,900 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-11 11:47:13,901 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:47:13,947 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:47:13,948 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:47:13,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:47:13 BoogieIcfgContainer [2024-10-11 11:47:13,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:47:13,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:47:13,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:47:13,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:47:13,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:47:00" (1/3) ... [2024-10-11 11:47:13,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579be319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:47:13, skipping insertion in model container [2024-10-11 11:47:13,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:00" (2/3) ... [2024-10-11 11:47:13,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579be319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:47:13, skipping insertion in model container [2024-10-11 11:47:13,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:47:13" (3/3) ... [2024-10-11 11:47:13,954 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-26.i [2024-10-11 11:47:13,968 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:47:13,968 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:47:14,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:47:14,024 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;@58e786d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:47:14,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:47:14,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 11:47:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 11:47:14,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:47:14,036 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 11:47:14,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:47:14,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:47:14,041 INFO L85 PathProgramCache]: Analyzing trace with hash 628465278, now seen corresponding path program 1 times [2024-10-11 11:47:14,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:47:14,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715181795] [2024-10-11 11:47:14,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:47:14,053 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-10-11 11:47:14,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:47:14,056 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 11:47:14,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 11:47:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:14,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:47:14,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:47:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-11 11:47:14,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:47:14,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:47:14,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715181795] [2024-10-11 11:47:14,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715181795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:47:14,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:47:14,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:47:14,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394001079] [2024-10-11 11:47:14,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:47:14,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:47:14,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:47:14,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:47:14,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:47:14,950 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 11:47:19,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:47:19,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:47:19,368 INFO L93 Difference]: Finished difference Result 107 states and 185 transitions. [2024-10-11 11:47:19,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:47:19,370 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2024-10-11 11:47:19,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:47:19,378 INFO L225 Difference]: With dead ends: 107 [2024-10-11 11:47:19,378 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 11:47:19,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-10-11 11:47:19,385 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 11:47:19,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 11:47:19,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 11:47:19,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 11:47:19,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 11:47:19,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 79 transitions. [2024-10-11 11:47:19,423 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 79 transitions. Word has length 114 [2024-10-11 11:47:19,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:47:19,423 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 79 transitions. [2024-10-11 11:47:19,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 11:47:19,423 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 79 transitions. [2024-10-11 11:47:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 11:47:19,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:47:19,426 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 11:47:19,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 11:47:19,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 11:47:19,628 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:47:19,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:47:19,628 INFO L85 PathProgramCache]: Analyzing trace with hash 878126714, now seen corresponding path program 1 times [2024-10-11 11:47:19,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:47:19,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812462674] [2024-10-11 11:47:19,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:47:19,629 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-10-11 11:47:19,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:47:19,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 11:47:19,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 11:47:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:20,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 11:47:20,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:47:22,795 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 233 proven. 39 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-10-11 11:47:22,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:47:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 11:47:24,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:47:24,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812462674] [2024-10-11 11:47:24,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812462674] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 11:47:24,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:47:24,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-11 11:47:24,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104596385] [2024-10-11 11:47:24,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:47:24,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:47:24,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:47:24,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:47:24,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:47:24,074 INFO L87 Difference]: Start difference. First operand 52 states and 79 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 11:47:28,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:47:32,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:47:37,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:47:41,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:47:45,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:47:45,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:47:45,225 INFO L93 Difference]: Finished difference Result 128 states and 192 transitions. [2024-10-11 11:47:45,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:47:45,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-10-11 11:47:45,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:47:45,227 INFO L225 Difference]: With dead ends: 128 [2024-10-11 11:47:45,227 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 11:47:45,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 11:47:45,229 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 33 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:47:45,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 233 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 21.0s Time] [2024-10-11 11:47:45,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 11:47:45,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2024-10-11 11:47:45,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.38) internal successors, (69), 51 states have internal predecessors, (69), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:47:45,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 111 transitions. [2024-10-11 11:47:45,241 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 111 transitions. Word has length 114 [2024-10-11 11:47:45,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:47:45,241 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 111 transitions. [2024-10-11 11:47:45,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 11:47:45,242 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 111 transitions. [2024-10-11 11:47:45,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 11:47:45,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:47:45,243 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 11:47:45,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 11:47:45,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 11:47:45,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:47:45,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:47:45,445 INFO L85 PathProgramCache]: Analyzing trace with hash 761568818, now seen corresponding path program 1 times [2024-10-11 11:47:45,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:47:45,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456569676] [2024-10-11 11:47:45,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:47:45,446 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-10-11 11:47:45,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:47:45,448 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 11:47:45,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 11:47:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:46,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 11:47:46,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:48:14,793 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 11:48:23,104 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 11:48:31,439 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)