./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-1loop_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 01455e7c8aff792a978e20323062f0f7b0c441ba70dceb4bfdd7b2a7e2a8be23 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:28:35,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:28:35,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:28:35,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:28:35,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:28:35,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:28:35,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:28:35,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:28:35,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:28:35,231 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:28:35,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:28:35,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:28:35,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:28:35,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:28:35,232 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:28:35,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:28:35,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:28:35,237 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:28:35,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:28:35,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:28:35,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:28:35,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:28:35,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:28:35,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:28:35,241 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:28:35,242 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:28:35,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:28:35,242 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:28:35,242 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:28:35,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:28:35,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:28:35,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:28:35,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:28:35,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:28:35,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:28:35,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:28:35,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:28:35,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:28:35,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:28:35,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:28:35,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:28:35,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:28:35,245 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01455e7c8aff792a978e20323062f0f7b0c441ba70dceb4bfdd7b2a7e2a8be23 [2024-10-24 09:28:35,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:28:35,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:28:35,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:28:35,491 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:28:35,491 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:28:35,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.i [2024-10-24 09:28:36,764 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:28:36,936 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:28:36,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.i [2024-10-24 09:28:36,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d14cbc9/a708494f225a44eab3d17cc52dd243cf/FLAG86ae91269 [2024-10-24 09:28:37,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d14cbc9/a708494f225a44eab3d17cc52dd243cf [2024-10-24 09:28:37,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:28:37,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:28:37,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:28:37,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:28:37,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:28:37,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:28:37" (1/1) ... [2024-10-24 09:28:37,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ebc918d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:37, skipping insertion in model container [2024-10-24 09:28:37,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:28:37" (1/1) ... [2024-10-24 09:28:37,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:28:37,505 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-1loop_file-58.i[915,928] [2024-10-24 09:28:37,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:28:37,551 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:28:37,560 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-1loop_file-58.i[915,928] [2024-10-24 09:28:37,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:28:37,610 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:28:37,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:37 WrapperNode [2024-10-24 09:28:37,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:28:37,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:28:37,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:28:37,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:28:37,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:37" (1/1) ... [2024-10-24 09:28:37,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:37" (1/1) ... [2024-10-24 09:28:37,663 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-10-24 09:28:37,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:28:37,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:28:37,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:28:37,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:28:37,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:37" (1/1) ... [2024-10-24 09:28:37,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:37" (1/1) ... [2024-10-24 09:28:37,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:37" (1/1) ... [2024-10-24 09:28:37,686 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-24 09:28:37,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:37" (1/1) ... [2024-10-24 09:28:37,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:37" (1/1) ... [2024-10-24 09:28:37,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:37" (1/1) ... [2024-10-24 09:28:37,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:37" (1/1) ... [2024-10-24 09:28:37,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:37" (1/1) ... [2024-10-24 09:28:37,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:37" (1/1) ... [2024-10-24 09:28:37,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:28:37,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:28:37,714 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:28:37,714 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:28:37,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:37" (1/1) ... [2024-10-24 09:28:37,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:28:37,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:28:37,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:28:37,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:28:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:28:37,792 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:28:37,793 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:28:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:28:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:28:37,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:28:37,857 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:28:37,861 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:28:38,093 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-24 09:28:38,093 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:28:38,141 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:28:38,141 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:28:38,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:28:38 BoogieIcfgContainer [2024-10-24 09:28:38,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:28:38,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:28:38,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:28:38,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:28:38,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:28:37" (1/3) ... [2024-10-24 09:28:38,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702b5273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:28:38, skipping insertion in model container [2024-10-24 09:28:38,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:37" (2/3) ... [2024-10-24 09:28:38,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702b5273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:28:38, skipping insertion in model container [2024-10-24 09:28:38,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:28:38" (3/3) ... [2024-10-24 09:28:38,149 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-58.i [2024-10-24 09:28:38,163 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:28:38,163 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:28:38,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:28:38,217 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;@129ba91a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:28:38,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:28:38,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 09:28:38,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 09:28:38,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:28:38,229 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:28:38,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:28:38,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:28:38,234 INFO L85 PathProgramCache]: Analyzing trace with hash 399837782, now seen corresponding path program 1 times [2024-10-24 09:28:38,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:28:38,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519372048] [2024-10-24 09:28:38,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:28:38,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:28:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:38,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:28:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:38,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:28:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:38,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:28:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:38,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:28:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:38,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:28:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:38,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:28:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:38,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:28:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:38,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:28:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:38,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:28:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:38,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:28:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:38,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:28:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:38,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:28:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 09:28:38,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:28:38,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519372048] [2024-10-24 09:28:38,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519372048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:28:38,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:28:38,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:28:38,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801259538] [2024-10-24 09:28:38,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:28:38,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:28:38,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:28:38,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:28:38,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:28:38,530 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 09:28:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:28:38,575 INFO L93 Difference]: Finished difference Result 77 states and 129 transitions. [2024-10-24 09:28:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:28:38,580 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 77 [2024-10-24 09:28:38,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:28:38,585 INFO L225 Difference]: With dead ends: 77 [2024-10-24 09:28:38,586 INFO L226 Difference]: Without dead ends: 37 [2024-10-24 09:28:38,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-24 09:28:38,592 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:28:38,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:28:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-24 09:28:38,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-24 09:28:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 09:28:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2024-10-24 09:28:38,628 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 77 [2024-10-24 09:28:38,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:28:38,628 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2024-10-24 09:28:38,628 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 09:28:38,629 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2024-10-24 09:28:38,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 09:28:38,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:28:38,631 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:28:38,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:28:38,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:28:38,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:28:38,632 INFO L85 PathProgramCache]: Analyzing trace with hash 669434002, now seen corresponding path program 1 times [2024-10-24 09:28:38,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:28:38,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209454672] [2024-10-24 09:28:38,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:28:38,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:28:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:28:38,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1298161316] [2024-10-24 09:28:38,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:28:38,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:28:38,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:28:38,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:28:38,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 09:28:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:38,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 09:28:38,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:28:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 182 proven. 27 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 09:28:39,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:28:54,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:28:54,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209454672] [2024-10-24 09:28:54,954 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 09:28:54,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298161316] [2024-10-24 09:28:54,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298161316] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:28:54,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 09:28:54,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-10-24 09:28:54,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184376423] [2024-10-24 09:28:54,955 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 09:28:54,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 09:28:54,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:28:54,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 09:28:54,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=163, Unknown=4, NotChecked=0, Total=210 [2024-10-24 09:28:54,957 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 09:28:59,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:28:59,106 INFO L93 Difference]: Finished difference Result 122 states and 171 transitions. [2024-10-24 09:28:59,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 09:28:59,107 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 77 [2024-10-24 09:28:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:28:59,108 INFO L225 Difference]: With dead ends: 122 [2024-10-24 09:28:59,109 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 09:28:59,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=183, Invalid=569, Unknown=4, NotChecked=0, Total=756 [2024-10-24 09:28:59,110 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 62 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 47 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:28:59,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 238 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 250 Invalid, 4 Unknown, 0 Unchecked, 2.2s Time] [2024-10-24 09:28:59,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 09:28:59,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2024-10-24 09:28:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 09:28:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 97 transitions. [2024-10-24 09:28:59,135 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 97 transitions. Word has length 77 [2024-10-24 09:28:59,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:28:59,135 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 97 transitions. [2024-10-24 09:28:59,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 09:28:59,136 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2024-10-24 09:28:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 09:28:59,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:28:59,138 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:28:59,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 09:28:59,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:28:59,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:28:59,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:28:59,342 INFO L85 PathProgramCache]: Analyzing trace with hash -139912624, now seen corresponding path program 1 times [2024-10-24 09:28:59,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:28:59,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402877814] [2024-10-24 09:28:59,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:28:59,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:28:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:03,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:29:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:03,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:29:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:03,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:29:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:03,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:29:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:03,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:29:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:03,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:29:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:03,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:29:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:03,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:29:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:03,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:29:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:03,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:29:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:03,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:29:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:03,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:29:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 09:29:03,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:29:03,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402877814] [2024-10-24 09:29:03,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402877814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:29:03,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:29:03,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 09:29:03,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523831865] [2024-10-24 09:29:03,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:29:03,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 09:29:03,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:29:03,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 09:29:03,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 09:29:03,958 INFO L87 Difference]: Start difference. First operand 70 states and 97 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 09:29:08,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:29:08,090 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2024-10-24 09:29:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 09:29:08,091 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2024-10-24 09:29:08,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:29:08,093 INFO L225 Difference]: With dead ends: 111 [2024-10-24 09:29:08,093 INFO L226 Difference]: Without dead ends: 109 [2024-10-24 09:29:08,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-10-24 09:29:08,094 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 101 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:29:08,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 245 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 09:29:08,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-24 09:29:08,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 80. [2024-10-24 09:29:08,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 09:29:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 108 transitions. [2024-10-24 09:29:08,120 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 108 transitions. Word has length 77 [2024-10-24 09:29:08,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:29:08,120 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 108 transitions. [2024-10-24 09:29:08,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 09:29:08,121 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2024-10-24 09:29:08,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 09:29:08,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:08,122 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:29:08,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:29:08,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:08,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:08,122 INFO L85 PathProgramCache]: Analyzing trace with hash -139853042, now seen corresponding path program 1 times [2024-10-24 09:29:08,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:29:08,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779855829] [2024-10-24 09:29:08,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:08,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:29:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:29:08,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1660743561] [2024-10-24 09:29:08,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:08,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:29:08,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:29:08,176 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:29:08,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 09:29:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:29:08,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:29:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:29:08,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:29:08,296 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:29:08,297 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:29:08,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 09:29:08,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-24 09:29:08,502 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 09:29:08,553 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:29:08,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:29:08 BoogieIcfgContainer [2024-10-24 09:29:08,557 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:29:08,558 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:29:08,558 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:29:08,558 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:29:08,558 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:28:38" (3/4) ... [2024-10-24 09:29:08,560 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:29:08,560 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:29:08,561 INFO L158 Benchmark]: Toolchain (without parser) took 31226.03ms. Allocated memory is still 190.8MB. Free memory was 124.2MB in the beginning and 136.4MB in the end (delta: -12.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:29:08,561 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:29:08,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.86ms. Allocated memory is still 190.8MB. Free memory was 124.0MB in the beginning and 163.5MB in the end (delta: -39.5MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2024-10-24 09:29:08,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.04ms. Allocated memory is still 190.8MB. Free memory was 163.5MB in the beginning and 160.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:29:08,562 INFO L158 Benchmark]: Boogie Preprocessor took 49.27ms. Allocated memory is still 190.8MB. Free memory was 160.4MB in the beginning and 156.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:29:08,562 INFO L158 Benchmark]: RCFGBuilder took 427.96ms. Allocated memory is still 190.8MB. Free memory was 156.0MB in the beginning and 136.5MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 09:29:08,562 INFO L158 Benchmark]: TraceAbstraction took 30414.55ms. Allocated memory is still 190.8MB. Free memory was 136.5MB in the beginning and 137.5MB in the end (delta: -934.4kB). Peak memory consumption was 1.7MB. Max. memory is 16.1GB. [2024-10-24 09:29:08,562 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 190.8MB. Free memory was 137.5MB in the beginning and 136.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:29:08,563 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.86ms. Allocated memory is still 190.8MB. Free memory was 124.0MB in the beginning and 163.5MB in the end (delta: -39.5MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.04ms. Allocated memory is still 190.8MB. Free memory was 163.5MB in the beginning and 160.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.27ms. Allocated memory is still 190.8MB. Free memory was 160.4MB in the beginning and 156.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 427.96ms. Allocated memory is still 190.8MB. Free memory was 156.0MB in the beginning and 136.5MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 30414.55ms. Allocated memory is still 190.8MB. Free memory was 136.5MB in the beginning and 137.5MB in the end (delta: -934.4kB). Peak memory consumption was 1.7MB. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 190.8MB. Free memory was 137.5MB in the beginning and 136.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 64; [L23] signed long int var_1_2 = 8; [L24] unsigned char var_1_3 = 25; [L25] unsigned char var_1_4 = 100; [L26] float var_1_5 = 99999999999.5; [L27] unsigned char var_1_6 = 4; [L28] float var_1_7 = 63.75; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char last_1_var_1_1 = 64; [L32] unsigned char last_1_var_1_9 = 0; [L94] isInitial = 1 [L95] FCALL initially() [L96] int k_loop; [L97] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=8, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L97] COND TRUE k_loop < 1 [L98] CALL updateLastVariables() [L86] last_1_var_1_1 = var_1_1 [L87] last_1_var_1_9 = var_1_9 [L98] RET updateLastVariables() [L99] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_long() [L67] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L67] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L68] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L69] var_1_3 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L70] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L71] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L72] var_1_4 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_4 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L73] RET assume_abort_if_not(var_1_4 >= 63) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L74] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L74] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L75] var_1_6 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L76] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_6 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L77] RET assume_abort_if_not(var_1_6 <= 255) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_7=255/4, var_1_9=0] [L78] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_7=255/4, var_1_9=0] [L79] var_1_7 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L80] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L81] var_1_10 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L82] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L83] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L99] RET updateVariables() [L100] CALL step() [L36] signed long int stepLocal_3 = last_1_var_1_1; [L37] signed long int stepLocal_2 = var_1_3 / var_1_6; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_2=0, stepLocal_3=64, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L38] COND TRUE var_1_3 < stepLocal_3 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_2=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L39] COND FALSE !(var_1_4 < stepLocal_2) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L49] signed long int stepLocal_1 = var_1_2; [L50] signed long int stepLocal_0 = var_1_2; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, stepLocal_1=-256, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L51] COND TRUE stepLocal_1 <= -256 [L52] var_1_1 = ((((var_1_3) < (((var_1_4 - 8) + 5))) ? (var_1_3) : (((var_1_4 - 8) + 5)))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L60] unsigned char stepLocal_4 = (var_1_1 + 64u) != var_1_4; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, stepLocal_4=0, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L61] COND FALSE !((var_1_5 >= var_1_7) || stepLocal_4) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L100] RET step() [L101] CALL, EXPR property() [L90-L91] return (((var_1_2 <= -256) ? (var_1_1 == ((unsigned char) ((((var_1_3) < (((var_1_4 - 8) + 5))) ? (var_1_3) : (((var_1_4 - 8) + 5)))))) : ((var_1_4 <= var_1_2) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((var_1_3 < last_1_var_1_1) ? ((var_1_4 < (var_1_3 / var_1_6)) ? (var_1_5 == ((float) (var_1_7 - 16.55f))) : 1) : (last_1_var_1_9 ? (var_1_5 == ((float) var_1_7)) : (var_1_5 == ((float) var_1_7))))) && (((var_1_5 >= var_1_7) || ((var_1_1 + 64u) != var_1_4)) ? (var_1_9 == ((unsigned char) var_1_10)) : 1) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.3s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 534 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 414 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 482 IncrementalHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 120 mSDtfsCounter, 482 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 21.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=3, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 45 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 462 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 228 ConstructedInterpolants, 2 QuantifiedInterpolants, 1307 SizeOfPredicates, 5 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 765/792 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-24 09:29:08,778 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-24 09:29:08,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 01455e7c8aff792a978e20323062f0f7b0c441ba70dceb4bfdd7b2a7e2a8be23 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:29:10,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:29:10,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:29:10,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:29:10,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:29:10,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:29:10,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:29:10,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:29:10,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:29:10,488 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:29:10,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:29:10,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:29:10,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:29:10,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:29:10,493 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:29:10,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:29:10,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:29:10,494 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:29:10,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:29:10,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:29:10,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:29:10,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:29:10,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:29:10,495 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:29:10,495 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:29:10,495 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:29:10,496 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:29:10,496 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:29:10,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:29:10,496 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:29:10,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:29:10,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:29:10,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:29:10,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:29:10,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:29:10,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:29:10,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:29:10,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:29:10,512 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:29:10,512 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:29:10,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:29:10,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:29:10,513 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:29:10,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:29:10,513 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:29:10,513 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01455e7c8aff792a978e20323062f0f7b0c441ba70dceb4bfdd7b2a7e2a8be23 [2024-10-24 09:29:10,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:29:10,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:29:10,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:29:10,831 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:29:10,832 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:29:10,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.i [2024-10-24 09:29:12,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:29:12,328 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:29:12,329 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.i [2024-10-24 09:29:12,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf87e3b14/23873ec701d14d1e8844d6c780b63e82/FLAGbbf466c9c [2024-10-24 09:29:12,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf87e3b14/23873ec701d14d1e8844d6c780b63e82 [2024-10-24 09:29:12,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:29:12,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:29:12,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:29:12,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:29:12,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:29:12,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:29:12" (1/1) ... [2024-10-24 09:29:12,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e7f265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:12, skipping insertion in model container [2024-10-24 09:29:12,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:29:12" (1/1) ... [2024-10-24 09:29:12,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:29:12,869 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-1loop_file-58.i[915,928] [2024-10-24 09:29:12,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:29:12,930 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:29:12,938 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-1loop_file-58.i[915,928] [2024-10-24 09:29:12,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:29:12,972 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:29:12,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:12 WrapperNode [2024-10-24 09:29:12,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:29:12,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:29:12,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:29:12,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:29:12,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:12" (1/1) ... [2024-10-24 09:29:12,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:12" (1/1) ... [2024-10-24 09:29:13,016 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-10-24 09:29:13,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:29:13,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:29:13,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:29:13,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:29:13,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:12" (1/1) ... [2024-10-24 09:29:13,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:12" (1/1) ... [2024-10-24 09:29:13,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:12" (1/1) ... [2024-10-24 09:29:13,055 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-24 09:29:13,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:12" (1/1) ... [2024-10-24 09:29:13,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:12" (1/1) ... [2024-10-24 09:29:13,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:12" (1/1) ... [2024-10-24 09:29:13,069 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:12" (1/1) ... [2024-10-24 09:29:13,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:12" (1/1) ... [2024-10-24 09:29:13,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:12" (1/1) ... [2024-10-24 09:29:13,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:29:13,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:29:13,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:29:13,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:29:13,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:12" (1/1) ... [2024-10-24 09:29:13,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:29:13,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:29:13,114 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:29:13,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:29:13,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:29:13,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:29:13,156 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:29:13,156 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:29:13,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:29:13,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:29:13,221 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:29:13,222 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:29:13,476 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-24 09:29:13,476 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:29:13,514 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:29:13,514 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:29:13,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:29:13 BoogieIcfgContainer [2024-10-24 09:29:13,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:29:13,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:29:13,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:29:13,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:29:13,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:29:12" (1/3) ... [2024-10-24 09:29:13,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40721a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:29:13, skipping insertion in model container [2024-10-24 09:29:13,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:12" (2/3) ... [2024-10-24 09:29:13,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40721a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:29:13, skipping insertion in model container [2024-10-24 09:29:13,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:29:13" (3/3) ... [2024-10-24 09:29:13,525 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-58.i [2024-10-24 09:29:13,537 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:29:13,538 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:29:13,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:29:13,593 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;@8b06727, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:29:13,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:29:13,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 09:29:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 09:29:13,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:13,605 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:29:13,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:13,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:13,609 INFO L85 PathProgramCache]: Analyzing trace with hash 399837782, now seen corresponding path program 1 times [2024-10-24 09:29:13,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:29:13,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305922820] [2024-10-24 09:29:13,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:13,619 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-24 09:29:13,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:29:13,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:29:13,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 09:29:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:13,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:29:13,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:29:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-10-24 09:29:13,787 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:29:13,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:29:13,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305922820] [2024-10-24 09:29:13,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305922820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:29:13,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:29:13,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:29:13,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258609716] [2024-10-24 09:29:13,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:29:13,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:29:13,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:29:13,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:29:13,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:29:13,816 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 09:29:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:29:13,886 INFO L93 Difference]: Finished difference Result 77 states and 129 transitions. [2024-10-24 09:29:13,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:29:13,888 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2024-10-24 09:29:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:29:13,893 INFO L225 Difference]: With dead ends: 77 [2024-10-24 09:29:13,893 INFO L226 Difference]: Without dead ends: 37 [2024-10-24 09:29:13,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 76 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-24 09:29:13,898 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:29:13,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:29:13,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-24 09:29:13,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-24 09:29:13,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 09:29:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2024-10-24 09:29:13,924 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 77 [2024-10-24 09:29:13,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:29:13,924 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2024-10-24 09:29:13,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 09:29:13,925 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2024-10-24 09:29:13,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 09:29:13,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:13,927 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:29:13,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 09:29:14,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:29:14,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:14,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash 669434002, now seen corresponding path program 1 times [2024-10-24 09:29:14,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:29:14,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147561444] [2024-10-24 09:29:14,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:14,130 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-24 09:29:14,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:29:14,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:29:14,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 09:29:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:14,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 09:29:14,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:29:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 179 proven. 39 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-24 09:29:15,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:29:30,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:29:30,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147561444] [2024-10-24 09:29:30,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147561444] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:29:30,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2026504564] [2024-10-24 09:29:30,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:30,925 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 09:29:30,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 09:29:30,928 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 09:29:30,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-24 09:29:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:31,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 09:29:31,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:29:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-10-24 09:29:51,595 INFO L311 TraceCheckSpWp]: Computing backward predicates...