./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_25-while_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-76.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c75bc8ff6ddd4017bafcb46906d532fdf98ed811c71357ea372210da1220295c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:49:09,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:49:09,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:49:09,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:49:09,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:49:09,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:49:09,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:49:09,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:49:09,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:49:09,169 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:49:09,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:49:09,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:49:09,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:49:09,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:49:09,173 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:49:09,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:49:09,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:49:09,174 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:49:09,174 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:49:09,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:49:09,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:49:09,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:49:09,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:49:09,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:49:09,179 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:49:09,179 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:49:09,180 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:49:09,180 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:49:09,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:49:09,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:49:09,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:49:09,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:49:09,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:49:09,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:49:09,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:49:09,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:49:09,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:49:09,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:49:09,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:49:09,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:49:09,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:49:09,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:49:09,190 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c75bc8ff6ddd4017bafcb46906d532fdf98ed811c71357ea372210da1220295c [2024-11-20 06:49:09,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:49:09,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:49:09,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:49:09,486 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:49:09,487 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:49:09,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-76.i [2024-11-20 06:49:10,964 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:49:11,180 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:49:11,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-76.i [2024-11-20 06:49:11,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08f67a704/8386779d48ba49dab16c7d22f8dbc114/FLAG08a93b64e [2024-11-20 06:49:11,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08f67a704/8386779d48ba49dab16c7d22f8dbc114 [2024-11-20 06:49:11,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:49:11,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:49:11,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:49:11,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:49:11,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:49:11,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:49:11" (1/1) ... [2024-11-20 06:49:11,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47f8212a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:11, skipping insertion in model container [2024-11-20 06:49:11,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:49:11" (1/1) ... [2024-11-20 06:49:11,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:49:11,757 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-76.i[915,928] [2024-11-20 06:49:11,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:49:11,813 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:49:11,824 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-76.i[915,928] [2024-11-20 06:49:11,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:49:11,863 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:49:11,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:11 WrapperNode [2024-11-20 06:49:11,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:49:11,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:49:11,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:49:11,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:49:11,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:11" (1/1) ... [2024-11-20 06:49:11,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:11" (1/1) ... [2024-11-20 06:49:11,919 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-11-20 06:49:11,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:49:11,921 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:49:11,921 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:49:11,921 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:49:11,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:11" (1/1) ... [2024-11-20 06:49:11,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:11" (1/1) ... [2024-11-20 06:49:11,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:11" (1/1) ... [2024-11-20 06:49:11,969 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 06:49:11,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:11" (1/1) ... [2024-11-20 06:49:11,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:11" (1/1) ... [2024-11-20 06:49:11,978 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:11" (1/1) ... [2024-11-20 06:49:11,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:11" (1/1) ... [2024-11-20 06:49:11,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:11" (1/1) ... [2024-11-20 06:49:11,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:11" (1/1) ... [2024-11-20 06:49:11,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:49:11,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:49:11,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:49:11,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:49:12,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:11" (1/1) ... [2024-11-20 06:49:12,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:49:12,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:49:12,048 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:49:12,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:49:12,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:49:12,102 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:49:12,102 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:49:12,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:49:12,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:49:12,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:49:12,163 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:49:12,170 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:49:12,458 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-20 06:49:12,458 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:49:12,469 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:49:12,470 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:49:12,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:49:12 BoogieIcfgContainer [2024-11-20 06:49:12,470 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:49:12,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:49:12,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:49:12,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:49:12,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:49:11" (1/3) ... [2024-11-20 06:49:12,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d02219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:49:12, skipping insertion in model container [2024-11-20 06:49:12,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:11" (2/3) ... [2024-11-20 06:49:12,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d02219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:49:12, skipping insertion in model container [2024-11-20 06:49:12,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:49:12" (3/3) ... [2024-11-20 06:49:12,481 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-76.i [2024-11-20 06:49:12,497 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:49:12,498 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:49:12,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:49:12,560 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;@6bc16531, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:49:12,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:49:12,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-20 06:49:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 06:49:12,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:49:12,574 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:49:12,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:49:12,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:49:12,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1176229072, now seen corresponding path program 1 times [2024-11-20 06:49:12,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:49:12,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644052996] [2024-11-20 06:49:12,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:49:12,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:49:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:12,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:49:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:12,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:49:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:12,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:49:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:12,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:49:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:12,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:49:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:12,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:49:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:12,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:49:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:12,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 06:49:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:12,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 06:49:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:12,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:49:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:12,902 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-20 06:49:12,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:49:12,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644052996] [2024-11-20 06:49:12,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644052996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:49:12,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:49:12,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:49:12,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81149458] [2024-11-20 06:49:12,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:49:12,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:49:12,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:49:12,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:49:12,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:49:12,941 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-20 06:49:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:49:12,963 INFO L93 Difference]: Finished difference Result 73 states and 116 transitions. [2024-11-20 06:49:12,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:49:12,966 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2024-11-20 06:49:12,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:49:12,975 INFO L225 Difference]: With dead ends: 73 [2024-11-20 06:49:12,975 INFO L226 Difference]: Without dead ends: 36 [2024-11-20 06:49:12,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:49:12,985 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:49:12,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:49:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-20 06:49:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-20 06:49:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-20 06:49:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-20 06:49:13,030 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 69 [2024-11-20 06:49:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:49:13,031 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-20 06:49:13,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-20 06:49:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-20 06:49:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 06:49:13,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:49:13,035 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:49:13,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:49:13,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:49:13,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:49:13,037 INFO L85 PathProgramCache]: Analyzing trace with hash -949125036, now seen corresponding path program 1 times [2024-11-20 06:49:13,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:49:13,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518194258] [2024-11-20 06:49:13,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:49:13,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:49:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:13,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:49:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:13,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:49:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:13,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:49:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:13,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:49:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:13,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:49:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:13,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:49:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:13,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:49:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:13,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 06:49:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:13,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 06:49:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:13,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:49:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-20 06:49:13,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:49:13,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518194258] [2024-11-20 06:49:13,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518194258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:49:13,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:49:13,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:49:13,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446857709] [2024-11-20 06:49:13,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:49:13,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:49:13,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:49:13,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:49:13,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:49:13,453 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-20 06:49:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:49:13,519 INFO L93 Difference]: Finished difference Result 102 states and 141 transitions. [2024-11-20 06:49:13,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:49:13,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2024-11-20 06:49:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:49:13,523 INFO L225 Difference]: With dead ends: 102 [2024-11-20 06:49:13,523 INFO L226 Difference]: Without dead ends: 69 [2024-11-20 06:49:13,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:49:13,527 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 25 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:49:13,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 130 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:49:13,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-20 06:49:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2024-11-20 06:49:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 06:49:13,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2024-11-20 06:49:13,554 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 69 [2024-11-20 06:49:13,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:49:13,555 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2024-11-20 06:49:13,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-20 06:49:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2024-11-20 06:49:13,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 06:49:13,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:49:13,558 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:49:13,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:49:13,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:49:13,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:49:13,560 INFO L85 PathProgramCache]: Analyzing trace with hash -891866734, now seen corresponding path program 1 times [2024-11-20 06:49:13,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:49:13,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830224800] [2024-11-20 06:49:13,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:49:13,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:49:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:49:13,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:49:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:49:13,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 06:49:13,756 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 06:49:13,758 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:49:13,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:49:13,762 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 06:49:13,840 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:49:13,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:49:13 BoogieIcfgContainer [2024-11-20 06:49:13,846 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:49:13,848 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:49:13,848 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:49:13,848 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:49:13,849 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:49:12" (3/4) ... [2024-11-20 06:49:13,851 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 06:49:13,852 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:49:13,853 INFO L158 Benchmark]: Toolchain (without parser) took 2302.20ms. Allocated memory is still 174.1MB. Free memory was 120.7MB in the beginning and 89.3MB in the end (delta: 31.5MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2024-11-20 06:49:13,853 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory was 141.0MB in the beginning and 140.7MB in the end (delta: 278.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:49:13,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.77ms. Allocated memory is still 174.1MB. Free memory was 120.3MB in the beginning and 106.4MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 06:49:13,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.07ms. Allocated memory is still 174.1MB. Free memory was 106.4MB in the beginning and 104.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 06:49:13,856 INFO L158 Benchmark]: Boogie Preprocessor took 77.27ms. Allocated memory is still 174.1MB. Free memory was 104.0MB in the beginning and 100.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:49:13,857 INFO L158 Benchmark]: RCFGBuilder took 471.81ms. Allocated memory is still 174.1MB. Free memory was 100.7MB in the beginning and 85.5MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 06:49:13,857 INFO L158 Benchmark]: TraceAbstraction took 1374.00ms. Allocated memory is still 174.1MB. Free memory was 85.1MB in the beginning and 90.3MB in the end (delta: -5.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:49:13,857 INFO L158 Benchmark]: Witness Printer took 4.64ms. Allocated memory is still 174.1MB. Free memory was 90.3MB in the beginning and 89.3MB in the end (delta: 991.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:49:13,862 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory was 141.0MB in the beginning and 140.7MB in the end (delta: 278.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.77ms. Allocated memory is still 174.1MB. Free memory was 120.3MB in the beginning and 106.4MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.07ms. Allocated memory is still 174.1MB. Free memory was 106.4MB in the beginning and 104.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.27ms. Allocated memory is still 174.1MB. Free memory was 104.0MB in the beginning and 100.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 471.81ms. Allocated memory is still 174.1MB. Free memory was 100.7MB in the beginning and 85.5MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1374.00ms. Allocated memory is still 174.1MB. Free memory was 85.1MB in the beginning and 90.3MB in the end (delta: -5.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.64ms. Allocated memory is still 174.1MB. Free memory was 90.3MB in the beginning and 89.3MB in the end (delta: 991.9kB). 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 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 0; [L26] signed short int var_1_8 = 4; [L27] float var_1_10 = 16.4; [L28] signed short int var_1_11 = -25; [L29] float var_1_13 = 128.1; [L30] float var_1_14 = 31.4; [L31] unsigned char var_1_15 = 2; [L32] unsigned char var_1_16 = 0; [L33] signed long int var_1_17 = 5; [L34] float last_1_var_1_13 = 128.1; [L35] signed long int last_1_var_1_17 = 5; VAL [isInitial=0, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L86] isInitial = 1 [L87] FCALL initially() [L88] COND TRUE 1 [L89] CALL updateLastVariables() [L78] last_1_var_1_13 = var_1_13 [L79] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L89] RET updateLastVariables() [L90] CALL updateVariables() [L60] var_1_5 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=4] [L61] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=4] [L62] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L62] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L63] var_1_6 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_7=0, var_1_8=4] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_7=0, var_1_8=4] [L65] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L65] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L66] var_1_7 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_8=4] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_8=4] [L68] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L68] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L69] var_1_10 = __VERIFIER_nondet_float() [L70] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L70] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L71] var_1_14 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L72] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L73] var_1_16 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L74] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L75] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=-206, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=-206, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L75] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=-206, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L90] RET updateVariables() [L91] CALL step() [L39] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=-206, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L44] var_1_17 = var_1_8 [L45] var_1_13 = var_1_14 [L46] var_1_15 = var_1_16 [L47] signed long int stepLocal_0 = (- 5) + var_1_17; VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, stepLocal_0=-1, var_1_11=-25, var_1_13=133, var_1_14=133, var_1_15=-206, var_1_16=-206, var_1_17=4, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L48] COND FALSE !(stepLocal_0 >= var_1_15) [L51] var_1_1 = ((var_1_5 && var_1_6) || var_1_7) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=133, var_1_14=133, var_1_15=-206, var_1_16=-206, var_1_17=4, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L53] COND TRUE var_1_10 >= 500.875f [L54] var_1_11 = ((((((((((((-50) < 0 ) ? -(-50) : (-50)))) > (var_1_8)) ? (((((-50) < 0 ) ? -(-50) : (-50)))) : (var_1_8)))) < (var_1_15)) ? (((((((((-50) < 0 ) ? -(-50) : (-50)))) > (var_1_8)) ? (((((-50) < 0 ) ? -(-50) : (-50)))) : (var_1_8)))) : (var_1_15))) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=50, var_1_13=133, var_1_14=133, var_1_15=-206, var_1_16=-206, var_1_17=4, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L91] RET step() [L92] CALL, EXPR property() [L82-L83] return ((((((((- 5) + var_1_17) >= var_1_15) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) ((var_1_5 && var_1_6) || var_1_7)))) && (var_1_5 ? ((0.4f > ((((last_1_var_1_13) < ((var_1_10 - 1.375f))) ? (last_1_var_1_13) : ((var_1_10 - 1.375f))))) ? (var_1_8 == ((signed short int) last_1_var_1_17)) : 1) : 1)) && ((var_1_10 >= 500.875f) ? (var_1_11 == ((signed short int) ((((((((((((-50) < 0 ) ? -(-50) : (-50)))) > (var_1_8)) ? (((((-50) < 0 ) ? -(-50) : (-50)))) : (var_1_8)))) < (var_1_15)) ? (((((((((-50) < 0 ) ? -(-50) : (-50)))) > (var_1_8)) ? (((((-50) < 0 ) ? -(-50) : (-50)))) : (var_1_8)))) : (var_1_15))))) : (var_1_11 == ((signed short int) var_1_15)))) && (var_1_13 == ((float) var_1_14))) && (var_1_15 == ((unsigned char) var_1_16))) && (var_1_17 == ((signed long int) var_1_8)) ; VAL [\result=0, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=50, var_1_13=133, var_1_14=133, var_1_15=-206, var_1_16=-206, var_1_17=4, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=50, var_1_13=133, var_1_14=133, var_1_15=-206, var_1_16=-206, var_1_17=4, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=50, var_1_13=133, var_1_14=133, var_1_15=-206, var_1_16=-206, var_1_17=4, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 179 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 94 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred 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.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 184 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 360/360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 06:49:13,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-76.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c75bc8ff6ddd4017bafcb46906d532fdf98ed811c71357ea372210da1220295c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:49:16,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:49:16,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 06:49:16,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:49:16,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:49:16,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:49:16,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:49:16,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:49:16,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:49:16,246 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:49:16,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:49:16,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:49:16,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:49:16,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:49:16,248 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:49:16,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:49:16,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:49:16,252 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:49:16,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:49:16,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:49:16,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:49:16,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:49:16,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:49:16,255 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 06:49:16,255 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 06:49:16,256 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:49:16,256 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 06:49:16,256 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:49:16,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:49:16,257 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:49:16,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:49:16,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:49:16,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:49:16,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:49:16,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:49:16,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:49:16,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:49:16,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:49:16,260 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 06:49:16,260 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 06:49:16,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:49:16,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:49:16,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:49:16,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:49:16,262 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c75bc8ff6ddd4017bafcb46906d532fdf98ed811c71357ea372210da1220295c [2024-11-20 06:49:16,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:49:16,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:49:16,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:49:16,608 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:49:16,608 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:49:16,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-76.i [2024-11-20 06:49:18,156 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:49:18,389 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:49:18,390 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-76.i [2024-11-20 06:49:18,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fea36511/34b058cd9873473ba2e20f6825dad794/FLAG94047cf02 [2024-11-20 06:49:18,411 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fea36511/34b058cd9873473ba2e20f6825dad794 [2024-11-20 06:49:18,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:49:18,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:49:18,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:49:18,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:49:18,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:49:18,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:49:18" (1/1) ... [2024-11-20 06:49:18,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7850ad89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:18, skipping insertion in model container [2024-11-20 06:49:18,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:49:18" (1/1) ... [2024-11-20 06:49:18,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:49:18,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-76.i[915,928] [2024-11-20 06:49:18,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:49:18,716 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:49:18,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-76.i[915,928] [2024-11-20 06:49:18,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:49:18,780 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:49:18,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:18 WrapperNode [2024-11-20 06:49:18,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:49:18,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:49:18,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:49:18,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:49:18,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:18" (1/1) ... [2024-11-20 06:49:18,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:18" (1/1) ... [2024-11-20 06:49:18,846 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-11-20 06:49:18,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:49:18,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:49:18,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:49:18,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:49:18,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:18" (1/1) ... [2024-11-20 06:49:18,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:18" (1/1) ... [2024-11-20 06:49:18,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:18" (1/1) ... [2024-11-20 06:49:18,883 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 06:49:18,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:18" (1/1) ... [2024-11-20 06:49:18,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:18" (1/1) ... [2024-11-20 06:49:18,900 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:18" (1/1) ... [2024-11-20 06:49:18,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:18" (1/1) ... [2024-11-20 06:49:18,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:18" (1/1) ... [2024-11-20 06:49:18,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:18" (1/1) ... [2024-11-20 06:49:18,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:49:18,920 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:49:18,920 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:49:18,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:49:18,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:18" (1/1) ... [2024-11-20 06:49:18,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:49:18,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:49:18,957 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:49:18,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:49:19,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:49:19,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 06:49:19,009 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:49:19,009 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:49:19,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:49:19,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:49:19,095 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:49:19,098 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:49:19,508 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-20 06:49:19,508 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:49:19,523 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:49:19,523 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:49:19,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:49:19 BoogieIcfgContainer [2024-11-20 06:49:19,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:49:19,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:49:19,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:49:19,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:49:19,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:49:18" (1/3) ... [2024-11-20 06:49:19,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532abd51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:49:19, skipping insertion in model container [2024-11-20 06:49:19,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:49:18" (2/3) ... [2024-11-20 06:49:19,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532abd51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:49:19, skipping insertion in model container [2024-11-20 06:49:19,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:49:19" (3/3) ... [2024-11-20 06:49:19,534 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-76.i [2024-11-20 06:49:19,552 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:49:19,552 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:49:19,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:49:19,617 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;@7a4f93f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:49:19,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:49:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-20 06:49:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 06:49:19,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:49:19,636 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:49:19,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:49:19,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:49:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1176229072, now seen corresponding path program 1 times [2024-11-20 06:49:19,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:49:19,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718962517] [2024-11-20 06:49:19,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:49:19,665 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:49:19,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:49:19,668 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:49:19,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 06:49:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:19,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 06:49:19,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:49:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-20 06:49:19,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:49:19,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:49:19,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718962517] [2024-11-20 06:49:19,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718962517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:49:19,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:49:19,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:49:19,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778599618] [2024-11-20 06:49:19,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:49:19,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:49:19,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:49:19,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:49:19,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:49:19,982 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-20 06:49:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:49:20,001 INFO L93 Difference]: Finished difference Result 73 states and 116 transitions. [2024-11-20 06:49:20,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:49:20,004 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2024-11-20 06:49:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:49:20,010 INFO L225 Difference]: With dead ends: 73 [2024-11-20 06:49:20,010 INFO L226 Difference]: Without dead ends: 36 [2024-11-20 06:49:20,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:49:20,018 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:49:20,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:49:20,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-20 06:49:20,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-20 06:49:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-20 06:49:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-20 06:49:20,055 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 69 [2024-11-20 06:49:20,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:49:20,056 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-20 06:49:20,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-20 06:49:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-20 06:49:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 06:49:20,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:49:20,059 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:49:20,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 06:49:20,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:49:20,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:49:20,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:49:20,261 INFO L85 PathProgramCache]: Analyzing trace with hash -949125036, now seen corresponding path program 1 times [2024-11-20 06:49:20,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:49:20,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337596760] [2024-11-20 06:49:20,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:49:20,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:49:20,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:49:20,265 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:49:20,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 06:49:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:20,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 06:49:20,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:49:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-20 06:49:20,741 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:49:20,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:49:20,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337596760] [2024-11-20 06:49:20,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337596760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:49:20,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:49:20,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:49:20,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266525391] [2024-11-20 06:49:20,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:49:20,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:49:20,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:49:20,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:49:20,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:49:20,745 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-20 06:49:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:49:20,935 INFO L93 Difference]: Finished difference Result 102 states and 141 transitions. [2024-11-20 06:49:20,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:49:20,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2024-11-20 06:49:20,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:49:20,941 INFO L225 Difference]: With dead ends: 102 [2024-11-20 06:49:20,941 INFO L226 Difference]: Without dead ends: 69 [2024-11-20 06:49:20,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:49:20,943 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:49:20,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 130 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:49:20,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-20 06:49:20,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2024-11-20 06:49:20,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 06:49:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2024-11-20 06:49:20,967 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 69 [2024-11-20 06:49:20,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:49:20,968 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2024-11-20 06:49:20,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-20 06:49:20,969 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2024-11-20 06:49:20,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 06:49:20,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:49:20,971 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:49:20,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 06:49:21,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:49:21,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:49:21,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:49:21,173 INFO L85 PathProgramCache]: Analyzing trace with hash -891866734, now seen corresponding path program 1 times [2024-11-20 06:49:21,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:49:21,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134032352] [2024-11-20 06:49:21,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:49:21,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:49:21,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:49:21,176 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:49:21,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 06:49:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:49:21,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-20 06:49:21,363 INFO L278 TraceCheckSpWp]: Computing forward predicates...