./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-76.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c75bc8ff6ddd4017bafcb46906d532fdf98ed811c71357ea372210da1220295c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:41:59,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:41:59,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:41:59,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:41:59,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:41:59,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:41:59,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:41:59,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:41:59,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:41:59,677 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:41:59,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:41:59,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:41:59,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:41:59,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:41:59,681 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:41:59,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:41:59,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:41:59,681 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:41:59,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:41:59,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:41:59,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:41:59,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:41:59,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:41:59,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:41:59,686 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:41:59,687 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:41:59,687 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:41:59,687 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:41:59,687 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:41:59,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:41:59,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:41:59,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:41:59,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:41:59,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:41:59,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:41:59,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:41:59,689 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:41:59,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:41:59,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:41:59,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:41:59,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:41:59,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:41:59,690 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c75bc8ff6ddd4017bafcb46906d532fdf98ed811c71357ea372210da1220295c [2024-10-11 11:41:59,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:41:59,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:41:59,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:41:59,922 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:41:59,923 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:41:59,924 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-10-11 11:42:01,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:42:01,458 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:42:01,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-76.i [2024-10-11 11:42:01,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8e7bdda20/73534dabd8ae4581809df287a14dd788/FLAGf9c551407 [2024-10-11 11:42:01,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8e7bdda20/73534dabd8ae4581809df287a14dd788 [2024-10-11 11:42:01,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:42:01,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:42:01,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:42:01,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:42:01,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:42:01,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:42:01" (1/1) ... [2024-10-11 11:42:01,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca7e276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:01, skipping insertion in model container [2024-10-11 11:42:01,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:42:01" (1/1) ... [2024-10-11 11:42:01,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:42:01,682 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-76.i[915,928] [2024-10-11 11:42:01,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:42:01,750 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:42:01,761 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-76.i[915,928] [2024-10-11 11:42:01,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:42:01,810 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:42:01,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:01 WrapperNode [2024-10-11 11:42:01,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:42:01,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:42:01,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:42:01,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:42:01,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:01" (1/1) ... [2024-10-11 11:42:01,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:01" (1/1) ... [2024-10-11 11:42:01,853 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-10-11 11:42:01,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:42:01,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:42:01,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:42:01,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:42:01,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:01" (1/1) ... [2024-10-11 11:42:01,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:01" (1/1) ... [2024-10-11 11:42:01,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:01" (1/1) ... [2024-10-11 11:42:01,898 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:42:01,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:01" (1/1) ... [2024-10-11 11:42:01,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:01" (1/1) ... [2024-10-11 11:42:01,907 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:01" (1/1) ... [2024-10-11 11:42:01,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:01" (1/1) ... [2024-10-11 11:42:01,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:01" (1/1) ... [2024-10-11 11:42:01,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:01" (1/1) ... [2024-10-11 11:42:01,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:42:01,936 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:42:01,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:42:01,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:42:01,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:01" (1/1) ... [2024-10-11 11:42:01,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:42:01,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:42:01,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:42:01,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:42:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:42:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:42:02,017 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:42:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:42:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:42:02,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:42:02,084 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:42:02,087 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:42:02,298 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 11:42:02,299 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:42:02,348 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:42:02,349 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:42:02,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:42:02 BoogieIcfgContainer [2024-10-11 11:42:02,349 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:42:02,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:42:02,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:42:02,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:42:02,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:42:01" (1/3) ... [2024-10-11 11:42:02,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8a703d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:42:02, skipping insertion in model container [2024-10-11 11:42:02,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:01" (2/3) ... [2024-10-11 11:42:02,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8a703d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:42:02, skipping insertion in model container [2024-10-11 11:42:02,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:42:02" (3/3) ... [2024-10-11 11:42:02,357 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-76.i [2024-10-11 11:42:02,372 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:42:02,372 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:42:02,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:42:02,441 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;@107914ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:42:02,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:42:02,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 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-10-11 11:42:02,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 11:42:02,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:42:02,455 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] [2024-10-11 11:42:02,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:42:02,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:42:02,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1860658635, now seen corresponding path program 1 times [2024-10-11 11:42:02,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:42:02,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710454100] [2024-10-11 11:42:02,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:42:02,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:42:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:02,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:42:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:02,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:42:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:02,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:42:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:02,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:42:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:02,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:42:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:02,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:42:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:02,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:42:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:02,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:42:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:02,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:42:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:02,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:42:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 11:42:02,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:42:02,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710454100] [2024-10-11 11:42:02,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710454100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:42:02,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:42:02,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:42:02,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353720208] [2024-10-11 11:42:02,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:42:02,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:42:02,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:42:02,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:42:02,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:42:02,777 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 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 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-10-11 11:42:02,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:42:02,818 INFO L93 Difference]: Finished difference Result 65 states and 108 transitions. [2024-10-11 11:42:02,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:42:02,821 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 65 [2024-10-11 11:42:02,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:42:02,826 INFO L225 Difference]: With dead ends: 65 [2024-10-11 11:42:02,827 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 11:42:02,830 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-10-11 11:42:02,835 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:42:02,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:42:02,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 11:42:02,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 11:42:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-10-11 11:42:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2024-10-11 11:42:02,874 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 65 [2024-10-11 11:42:02,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:42:02,874 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2024-10-11 11:42:02,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-10-11 11:42:02,875 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2024-10-11 11:42:02,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 11:42:02,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:42:02,877 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] [2024-10-11 11:42:02,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:42:02,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:42:02,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:42:02,878 INFO L85 PathProgramCache]: Analyzing trace with hash -424658489, now seen corresponding path program 1 times [2024-10-11 11:42:02,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:42:02,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997411594] [2024-10-11 11:42:02,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:42:02,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:42:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:03,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:42:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:03,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:42:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:03,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:42:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:03,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:42:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:03,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:42:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:03,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:42:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:03,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:42:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:03,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:42:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:03,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:42:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:03,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:42:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 11:42:03,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:42:03,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997411594] [2024-10-11 11:42:03,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997411594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:42:03,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:42:03,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:42:03,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700833234] [2024-10-11 11:42:03,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:42:03,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:42:03,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:42:03,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:42:03,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:42:03,193 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-10-11 11:42:03,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:42:03,251 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2024-10-11 11:42:03,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:42:03,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 65 [2024-10-11 11:42:03,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:42:03,254 INFO L225 Difference]: With dead ends: 94 [2024-10-11 11:42:03,254 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 11:42:03,255 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-10-11 11:42:03,256 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:42:03,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 115 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:42:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 11:42:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2024-10-11 11:42:03,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 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-10-11 11:42:03,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2024-10-11 11:42:03,270 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 65 [2024-10-11 11:42:03,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:42:03,271 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2024-10-11 11:42:03,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-10-11 11:42:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2024-10-11 11:42:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 11:42:03,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:42:03,272 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] [2024-10-11 11:42:03,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:42:03,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:42:03,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:42:03,273 INFO L85 PathProgramCache]: Analyzing trace with hash -422811447, now seen corresponding path program 1 times [2024-10-11 11:42:03,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:42:03,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208838027] [2024-10-11 11:42:03,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:42:03,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:42:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:42:03,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:42:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:42:03,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:42:03,454 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:42:03,456 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:42:03,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:42:03,463 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 11:42:03,521 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:42:03,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:42:03 BoogieIcfgContainer [2024-10-11 11:42:03,526 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:42:03,526 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:42:03,526 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:42:03,527 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:42:03,527 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:42:02" (3/4) ... [2024-10-11 11:42:03,529 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:42:03,530 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:42:03,530 INFO L158 Benchmark]: Toolchain (without parser) took 2046.16ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 109.0MB in the beginning and 225.3MB in the end (delta: -116.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:42:03,531 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 180.4MB. Free memory is still 134.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:42:03,531 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.88ms. Allocated memory is still 180.4MB. Free memory was 108.8MB in the beginning and 94.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 11:42:03,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.03ms. Allocated memory is still 180.4MB. Free memory was 93.9MB in the beginning and 91.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:42:03,531 INFO L158 Benchmark]: Boogie Preprocessor took 81.63ms. Allocated memory is still 180.4MB. Free memory was 91.6MB in the beginning and 148.3MB in the end (delta: -56.7MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2024-10-11 11:42:03,532 INFO L158 Benchmark]: RCFGBuilder took 412.82ms. Allocated memory is still 180.4MB. Free memory was 148.3MB in the beginning and 130.6MB in the end (delta: 17.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 11:42:03,535 INFO L158 Benchmark]: TraceAbstraction took 1174.91ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 130.6MB in the beginning and 225.3MB in the end (delta: -94.6MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. [2024-10-11 11:42:03,535 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 262.1MB. Free memory is still 225.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:42:03,537 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.18ms. Allocated memory is still 180.4MB. Free memory is still 134.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.88ms. Allocated memory is still 180.4MB. Free memory was 108.8MB in the beginning and 94.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.03ms. Allocated memory is still 180.4MB. Free memory was 93.9MB in the beginning and 91.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.63ms. Allocated memory is still 180.4MB. Free memory was 91.6MB in the beginning and 148.3MB in the end (delta: -56.7MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * RCFGBuilder took 412.82ms. Allocated memory is still 180.4MB. Free memory was 148.3MB in the beginning and 130.6MB in the end (delta: 17.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1174.91ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 130.6MB in the beginning and 225.3MB in the end (delta: -94.6MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 262.1MB. Free memory is still 225.3MB. 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; [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 [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=-252, 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=-252, 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=-252, 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=-252, 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=-252, var_1_16=-252, 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=-252, var_1_16=-252, 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=4, var_1_13=133, var_1_14=133, var_1_15=-252, var_1_16=-252, 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)) ; [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=4, var_1_13=133, var_1_14=133, var_1_15=-252, var_1_16=-252, 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=4, var_1_13=133, var_1_14=133, var_1_15=-252, var_1_16=-252, 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, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 157 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 81 mSDtfsCounter, 22 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=61occurred 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.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 170 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-10-11 11:42:03,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-76.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c75bc8ff6ddd4017bafcb46906d532fdf98ed811c71357ea372210da1220295c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:42:05,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:42:05,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:42:05,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:42:05,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:42:05,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:42:05,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:42:05,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:42:05,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:42:05,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:42:05,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:42:05,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:42:05,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:42:05,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:42:05,593 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:42:05,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:42:05,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:42:05,594 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:42:05,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:42:05,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:42:05,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:42:05,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:42:05,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:42:05,596 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:42:05,596 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:42:05,596 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:42:05,599 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:42:05,599 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:42:05,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:42:05,600 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:42:05,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:42:05,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:42:05,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:42:05,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:42:05,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:42:05,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:42:05,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:42:05,601 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:42:05,601 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:42:05,601 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:42:05,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:42:05,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:42:05,602 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:42:05,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:42:05,602 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:42:05,602 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c75bc8ff6ddd4017bafcb46906d532fdf98ed811c71357ea372210da1220295c [2024-10-11 11:42:05,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:42:05,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:42:05,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:42:05,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:42:05,949 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:42:05,950 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-10-11 11:42:07,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:42:07,534 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:42:07,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-76.i [2024-10-11 11:42:07,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1dd8bfbdd/2c4a496ecfcf488ea6ec5677524cc2fe/FLAG7a88ecf45 [2024-10-11 11:42:07,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1dd8bfbdd/2c4a496ecfcf488ea6ec5677524cc2fe [2024-10-11 11:42:07,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:42:07,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:42:07,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:42:07,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:42:07,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:42:07,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:42:07" (1/1) ... [2024-10-11 11:42:07,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dcedf85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:07, skipping insertion in model container [2024-10-11 11:42:07,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:42:07" (1/1) ... [2024-10-11 11:42:07,968 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:42:08,140 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-76.i[915,928] [2024-10-11 11:42:08,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:42:08,214 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:42:08,224 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-76.i[915,928] [2024-10-11 11:42:08,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:42:08,262 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:42:08,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:08 WrapperNode [2024-10-11 11:42:08,264 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:42:08,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:42:08,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:42:08,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:42:08,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:08" (1/1) ... [2024-10-11 11:42:08,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:08" (1/1) ... [2024-10-11 11:42:08,306 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-10-11 11:42:08,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:42:08,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:42:08,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:42:08,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:42:08,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:08" (1/1) ... [2024-10-11 11:42:08,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:08" (1/1) ... [2024-10-11 11:42:08,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:08" (1/1) ... [2024-10-11 11:42:08,346 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:42:08,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:08" (1/1) ... [2024-10-11 11:42:08,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:08" (1/1) ... [2024-10-11 11:42:08,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:08" (1/1) ... [2024-10-11 11:42:08,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:08" (1/1) ... [2024-10-11 11:42:08,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:08" (1/1) ... [2024-10-11 11:42:08,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:08" (1/1) ... [2024-10-11 11:42:08,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:42:08,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:42:08,372 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:42:08,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:42:08,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:08" (1/1) ... [2024-10-11 11:42:08,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:42:08,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:42:08,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:42:08,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:42:08,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:42:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:42:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:42:08,454 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:42:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:42:08,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:42:08,533 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:42:08,536 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:42:08,893 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 11:42:08,893 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:42:08,937 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:42:08,937 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:42:08,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:42:08 BoogieIcfgContainer [2024-10-11 11:42:08,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:42:08,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:42:08,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:42:08,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:42:08,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:42:07" (1/3) ... [2024-10-11 11:42:08,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256386ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:42:08, skipping insertion in model container [2024-10-11 11:42:08,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:08" (2/3) ... [2024-10-11 11:42:08,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256386ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:42:08, skipping insertion in model container [2024-10-11 11:42:08,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:42:08" (3/3) ... [2024-10-11 11:42:08,948 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-76.i [2024-10-11 11:42:08,965 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:42:08,965 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:42:09,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:42:09,039 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;@3fd886e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:42:09,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:42:09,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 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-10-11 11:42:09,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 11:42:09,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:42:09,056 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] [2024-10-11 11:42:09,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:42:09,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:42:09,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1860658635, now seen corresponding path program 1 times [2024-10-11 11:42:09,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:42:09,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052662127] [2024-10-11 11:42:09,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:42:09,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:42:09,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:42:09,088 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:42:09,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:42:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:09,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:42:09,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:42:09,379 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-10-11 11:42:09,380 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:42:09,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:42:09,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052662127] [2024-10-11 11:42:09,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1052662127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:42:09,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:42:09,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:42:09,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509494757] [2024-10-11 11:42:09,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:42:09,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:42:09,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:42:09,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:42:09,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:42:09,414 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 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 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 11:42:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:42:09,485 INFO L93 Difference]: Finished difference Result 65 states and 108 transitions. [2024-10-11 11:42:09,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:42:09,492 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 2 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 65 [2024-10-11 11:42:09,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:42:09,498 INFO L225 Difference]: With dead ends: 65 [2024-10-11 11:42:09,499 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 11:42:09,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:42:09,506 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:42:09,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:42:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 11:42:09,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 11:42:09,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-10-11 11:42:09,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2024-10-11 11:42:09,546 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 65 [2024-10-11 11:42:09,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:42:09,547 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2024-10-11 11:42:09,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 11:42:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2024-10-11 11:42:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 11:42:09,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:42:09,551 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] [2024-10-11 11:42:09,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 11:42:09,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:42:09,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:42:09,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:42:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash -424658489, now seen corresponding path program 1 times [2024-10-11 11:42:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:42:09,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927669972] [2024-10-11 11:42:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:42:09,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:42:09,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:42:09,759 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:42:09,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:42:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:09,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 11:42:09,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:42:10,187 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 11:42:10,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:42:10,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:42:10,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927669972] [2024-10-11 11:42:10,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [927669972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:42:10,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:42:10,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:42:10,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206219652] [2024-10-11 11:42:10,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:42:10,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:42:10,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:42:10,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:42:10,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:42:10,194 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-10-11 11:42:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:42:10,347 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2024-10-11 11:42:10,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:42:10,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 65 [2024-10-11 11:42:10,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:42:10,350 INFO L225 Difference]: With dead ends: 94 [2024-10-11 11:42:10,350 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 11:42:10,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 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-10-11 11:42:10,351 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:42:10,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 115 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:42:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 11:42:10,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2024-10-11 11:42:10,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 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-10-11 11:42:10,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2024-10-11 11:42:10,375 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 65 [2024-10-11 11:42:10,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:42:10,375 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2024-10-11 11:42:10,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-10-11 11:42:10,376 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2024-10-11 11:42:10,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 11:42:10,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:42:10,377 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] [2024-10-11 11:42:10,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 11:42:10,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:42:10,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:42:10,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:42:10,581 INFO L85 PathProgramCache]: Analyzing trace with hash -422811447, now seen corresponding path program 1 times [2024-10-11 11:42:10,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:42:10,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35295938] [2024-10-11 11:42:10,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:42:10,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:42:10,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:42:10,586 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:42:10,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 11:42:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:10,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 11:42:10,760 INFO L278 TraceCheckSpWp]: Computing forward predicates...