./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-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-54.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 8cfcfd272855d27ce62fb23250668d204eb8b7cef032f32eb6bf38a181db8911 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:36:38,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:36:38,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:36:38,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:36:38,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:36:38,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:36:38,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:36:38,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:36:38,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:36:38,497 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:36:38,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:36:38,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:36:38,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:36:38,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:36:38,508 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:36:38,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:36:38,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:36:38,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:36:38,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:36:38,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:36:38,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:36:38,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:36:38,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:36:38,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:36:38,511 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:36:38,511 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:36:38,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:36:38,512 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:36:38,512 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:36:38,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:36:38,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:36:38,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:36:38,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:36:38,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:36:38,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:36:38,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:36:38,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:36:38,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:36:38,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:36:38,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:36:38,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:36:38,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:36:38,514 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 -> 8cfcfd272855d27ce62fb23250668d204eb8b7cef032f32eb6bf38a181db8911 [2024-10-14 11:36:38,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:36:38,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:36:38,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:36:38,756 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:36:38,756 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:36:38,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-54.i [2024-10-14 11:36:39,976 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:36:40,130 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:36:40,131 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-54.i [2024-10-14 11:36:40,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37314764c/6d6692b3a3914627a42831e57054f604/FLAG159764306 [2024-10-14 11:36:40,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37314764c/6d6692b3a3914627a42831e57054f604 [2024-10-14 11:36:40,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:36:40,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:36:40,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:36:40,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:36:40,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:36:40,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:36:40" (1/1) ... [2024-10-14 11:36:40,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@782482c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:40, skipping insertion in model container [2024-10-14 11:36:40,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:36:40" (1/1) ... [2024-10-14 11:36:40,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:36:40,291 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-54.i[915,928] [2024-10-14 11:36:40,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:36:40,333 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:36:40,343 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-54.i[915,928] [2024-10-14 11:36:40,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:36:40,373 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:36:40,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:40 WrapperNode [2024-10-14 11:36:40,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:36:40,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:36:40,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:36:40,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:36:40,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:40" (1/1) ... [2024-10-14 11:36:40,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:40" (1/1) ... [2024-10-14 11:36:40,412 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2024-10-14 11:36:40,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:36:40,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:36:40,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:36:40,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:36:40,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:40" (1/1) ... [2024-10-14 11:36:40,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:40" (1/1) ... [2024-10-14 11:36:40,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:40" (1/1) ... [2024-10-14 11:36:40,435 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-14 11:36:40,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:40" (1/1) ... [2024-10-14 11:36:40,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:40" (1/1) ... [2024-10-14 11:36:40,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:40" (1/1) ... [2024-10-14 11:36:40,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:40" (1/1) ... [2024-10-14 11:36:40,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:40" (1/1) ... [2024-10-14 11:36:40,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:40" (1/1) ... [2024-10-14 11:36:40,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:36:40,449 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:36:40,449 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:36:40,449 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:36:40,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:40" (1/1) ... [2024-10-14 11:36:40,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:36:40,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:36:40,481 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-14 11:36:40,483 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-14 11:36:40,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:36:40,521 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:36:40,522 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:36:40,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:36:40,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:36:40,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:36:40,586 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:36:40,589 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:36:40,769 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 11:36:40,769 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:36:40,823 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:36:40,823 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:36:40,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:36:40 BoogieIcfgContainer [2024-10-14 11:36:40,823 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:36:40,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:36:40,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:36:40,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:36:40,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:36:40" (1/3) ... [2024-10-14 11:36:40,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547cecb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:36:40, skipping insertion in model container [2024-10-14 11:36:40,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:40" (2/3) ... [2024-10-14 11:36:40,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547cecb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:36:40, skipping insertion in model container [2024-10-14 11:36:40,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:36:40" (3/3) ... [2024-10-14 11:36:40,834 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-54.i [2024-10-14 11:36:40,848 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:36:40,848 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:36:40,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:36:40,905 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;@3b2a2213, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:36:40,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:36:40,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 11:36:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 11:36:40,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:36:40,919 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:36:40,919 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:36:40,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:36:40,924 INFO L85 PathProgramCache]: Analyzing trace with hash -822484078, now seen corresponding path program 1 times [2024-10-14 11:36:40,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:36:40,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219962193] [2024-10-14 11:36:40,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:36:40,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:36:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:36:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:36:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:36:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:36:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:36:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:36:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:36:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:36:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:36:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:36:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:36:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 11:36:41,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:36:41,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219962193] [2024-10-14 11:36:41,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219962193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:36:41,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:36:41,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:36:41,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538090138] [2024-10-14 11:36:41,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:36:41,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:36:41,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:36:41,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:36:41,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:36:41,234 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 11:36:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:36:41,263 INFO L93 Difference]: Finished difference Result 71 states and 116 transitions. [2024-10-14 11:36:41,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:36:41,268 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 71 [2024-10-14 11:36:41,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:36:41,274 INFO L225 Difference]: With dead ends: 71 [2024-10-14 11:36:41,274 INFO L226 Difference]: Without dead ends: 34 [2024-10-14 11:36:41,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-14 11:36:41,281 INFO L432 NwaCegarLoop]: 44 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, 44 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-14 11:36:41,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:36:41,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-14 11:36:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-14 11:36:41,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 11:36:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2024-10-14 11:36:41,310 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 71 [2024-10-14 11:36:41,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:36:41,310 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2024-10-14 11:36:41,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 11:36:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2024-10-14 11:36:41,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 11:36:41,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:36:41,313 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:36:41,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:36:41,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:36:41,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:36:41,314 INFO L85 PathProgramCache]: Analyzing trace with hash -444207410, now seen corresponding path program 1 times [2024-10-14 11:36:41,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:36:41,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212257231] [2024-10-14 11:36:41,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:36:41,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:36:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:36:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:36:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:36:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:36:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:36:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:36:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:36:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:36:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:36:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:36:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:36:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 11:36:41,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:36:41,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212257231] [2024-10-14 11:36:41,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212257231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:36:41,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:36:41,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:36:41,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474767679] [2024-10-14 11:36:41,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:36:41,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:36:41,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:36:41,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:36:41,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:36:41,577 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 11:36:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:36:41,621 INFO L93 Difference]: Finished difference Result 68 states and 94 transitions. [2024-10-14 11:36:41,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:36:41,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 71 [2024-10-14 11:36:41,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:36:41,623 INFO L225 Difference]: With dead ends: 68 [2024-10-14 11:36:41,624 INFO L226 Difference]: Without dead ends: 35 [2024-10-14 11:36:41,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:36:41,626 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 12 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:36:41,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 107 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:36:41,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-14 11:36:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-10-14 11:36:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 11:36:41,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2024-10-14 11:36:41,635 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 71 [2024-10-14 11:36:41,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:36:41,636 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2024-10-14 11:36:41,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 11:36:41,636 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2024-10-14 11:36:41,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 11:36:41,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:36:41,637 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:36:41,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:36:41,638 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:36:41,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:36:41,639 INFO L85 PathProgramCache]: Analyzing trace with hash -386949108, now seen corresponding path program 1 times [2024-10-14 11:36:41,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:36:41,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993587849] [2024-10-14 11:36:41,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:36:41,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:36:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:36:41,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:36:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:36:41,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:36:41,835 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:36:41,836 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:36:41,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:36:41,842 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-14 11:36:41,893 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:36:41,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:36:41 BoogieIcfgContainer [2024-10-14 11:36:41,895 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:36:41,896 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:36:41,896 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:36:41,896 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:36:41,896 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:36:40" (3/4) ... [2024-10-14 11:36:41,898 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:36:41,899 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:36:41,899 INFO L158 Benchmark]: Toolchain (without parser) took 1748.40ms. Allocated memory is still 176.2MB. Free memory was 124.6MB in the beginning and 88.8MB in the end (delta: 35.8MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2024-10-14 11:36:41,901 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:36:41,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.82ms. Allocated memory is still 176.2MB. Free memory was 123.9MB in the beginning and 110.6MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 11:36:41,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.31ms. Allocated memory is still 176.2MB. Free memory was 110.6MB in the beginning and 107.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:36:41,901 INFO L158 Benchmark]: Boogie Preprocessor took 35.24ms. Allocated memory is still 176.2MB. Free memory was 107.8MB in the beginning and 103.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:36:41,903 INFO L158 Benchmark]: RCFGBuilder took 374.84ms. Allocated memory is still 176.2MB. Free memory was 103.6MB in the beginning and 84.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 11:36:41,904 INFO L158 Benchmark]: TraceAbstraction took 1069.39ms. Allocated memory is still 176.2MB. Free memory was 84.1MB in the beginning and 88.8MB in the end (delta: -4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:36:41,904 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 176.2MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:36:41,905 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.13ms. Allocated memory is still 176.2MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.82ms. Allocated memory is still 176.2MB. Free memory was 123.9MB in the beginning and 110.6MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.31ms. Allocated memory is still 176.2MB. Free memory was 110.6MB in the beginning and 107.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.24ms. Allocated memory is still 176.2MB. Free memory was 107.8MB in the beginning and 103.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 374.84ms. Allocated memory is still 176.2MB. Free memory was 103.6MB in the beginning and 84.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1069.39ms. Allocated memory is still 176.2MB. Free memory was 84.1MB in the beginning and 88.8MB in the end (delta: -4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 176.2MB. Free memory is still 88.8MB. 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 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_3 = 10; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_6 = 1; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 0; [L28] unsigned long int var_1_9 = 5; [L29] unsigned long int var_1_10 = 3126062476; [L30] unsigned short int var_1_13 = 10; [L31] signed long int var_1_14 = 128; [L32] float var_1_15 = 4.2; [L33] float var_1_16 = 5.1; [L85] isInitial = 1 [L86] FCALL initially() [L87] int k_loop; [L88] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=10, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L88] COND TRUE k_loop < 1 [L89] FCALL updateLastVariables() [L90] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L62] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L62] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L63] var_1_6 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_7=0, var_1_8=0, var_1_9=5] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_7=0, var_1_8=0, var_1_9=5] [L65] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L65] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L66] var_1_7 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_8=0, var_1_9=5] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_8=0, var_1_9=5] [L68] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L68] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L69] var_1_8 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_9=5] [L70] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_9=5] [L71] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] [L71] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] [L72] var_1_10 = __VERIFIER_nondet_ulong() [L73] CALL assume_abort_if_not(var_1_10 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] [L73] RET assume_abort_if_not(var_1_10 >= 2147483647) VAL [isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] [L74] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] [L74] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] [L75] var_1_16 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] [L76] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2147483647, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] [L90] RET updateVariables() [L91] CALL step() [L37] var_1_13 = var_1_3 [L38] var_1_14 = var_1_3 [L39] var_1_15 = var_1_16 [L40] unsigned short int stepLocal_0 = var_1_13; VAL [isInitial=1, var_1_10=2147483647, var_1_13=0, var_1_14=0, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] [L41] COND FALSE !(-4 >= stepLocal_0) VAL [isInitial=1, var_1_10=2147483647, var_1_13=0, var_1_14=0, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] [L44] signed long int stepLocal_2 = var_1_14; VAL [isInitial=1, stepLocal_2=0, var_1_10=2147483647, var_1_13=0, var_1_14=0, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] [L45] COND FALSE !(var_1_3 < stepLocal_2) VAL [isInitial=1, var_1_10=2147483647, var_1_13=0, var_1_14=0, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] [L48] unsigned long int stepLocal_1 = 8 * var_1_9; VAL [isInitial=1, stepLocal_1=40, var_1_10=2147483647, var_1_13=0, var_1_14=0, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=0, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] [L49] COND FALSE !(stepLocal_1 == ((((10) > (var_1_9)) ? (10) : (var_1_9)))) [L56] var_1_4 = var_1_8 VAL [isInitial=1, var_1_10=2147483647, var_1_13=0, var_1_14=0, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=0, var_1_4=-256, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] [L91] RET step() [L92] CALL, EXPR property() [L81-L82] return ((((((-4 >= var_1_13) ? (var_1_1 == ((unsigned char) ((((var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * var_1_9) == ((((10) > (var_1_9)) ? (10) : (var_1_9)))) ? (var_1_6 ? (var_1_4 == ((unsigned char) (var_1_7 && var_1_8))) : (var_1_4 == ((unsigned char) var_1_8))) : (var_1_4 == ((unsigned char) var_1_8)))) && ((var_1_3 < var_1_14) ? (var_1_9 == ((unsigned long int) (((((3851651024u - var_1_3)) < ((((((var_1_10 - var_1_13)) > ((var_1_1 + var_1_1))) ? ((var_1_10 - var_1_13)) : ((var_1_1 + var_1_1)))))) ? ((3851651024u - var_1_3)) : ((((((var_1_10 - var_1_13)) > ((var_1_1 + var_1_1))) ? ((var_1_10 - var_1_13)) : ((var_1_1 + var_1_1))))))))) : 1)) && (var_1_13 == ((unsigned short int) var_1_3))) && (var_1_14 == ((signed long int) var_1_3))) && (var_1_15 == ((float) var_1_16)) ; [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2147483647, var_1_13=0, var_1_14=0, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=0, var_1_4=-256, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] [L19] reach_error() VAL [isInitial=1, var_1_10=2147483647, var_1_13=0, var_1_14=0, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=0, var_1_4=-256, var_1_6=1, var_1_7=0, var_1_8=-256, var_1_9=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 151 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 84 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 164 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 440/440 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-14 11:36:41,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-54.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 8cfcfd272855d27ce62fb23250668d204eb8b7cef032f32eb6bf38a181db8911 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:36:43,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:36:43,715 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:36:43,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:36:43,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:36:43,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:36:43,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:36:43,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:36:43,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:36:43,751 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:36:43,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:36:43,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:36:43,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:36:43,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:36:43,753 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:36:43,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:36:43,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:36:43,756 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:36:43,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:36:43,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:36:43,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:36:43,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:36:43,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:36:43,758 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:36:43,758 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:36:43,758 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:36:43,758 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:36:43,758 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:36:43,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:36:43,759 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:36:43,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:36:43,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:36:43,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:36:43,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:36:43,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:36:43,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:36:43,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:36:43,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:36:43,761 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:36:43,761 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:36:43,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:36:43,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:36:43,762 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:36:43,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:36:43,762 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:36:43,762 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 -> 8cfcfd272855d27ce62fb23250668d204eb8b7cef032f32eb6bf38a181db8911 [2024-10-14 11:36:44,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:36:44,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:36:44,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:36:44,049 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:36:44,050 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:36:44,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-54.i [2024-10-14 11:36:45,282 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:36:45,444 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:36:45,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-54.i [2024-10-14 11:36:45,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6655ad5a2/0ecf32765b7d46b9bbc81c7840f48cd2/FLAGf915be933 [2024-10-14 11:36:45,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6655ad5a2/0ecf32765b7d46b9bbc81c7840f48cd2 [2024-10-14 11:36:45,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:36:45,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:36:45,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:36:45,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:36:45,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:36:45,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:36:45" (1/1) ... [2024-10-14 11:36:45,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65f0244e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:45, skipping insertion in model container [2024-10-14 11:36:45,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:36:45" (1/1) ... [2024-10-14 11:36:45,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:36:45,614 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-54.i[915,928] [2024-10-14 11:36:45,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:36:45,678 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:36:45,693 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-54.i[915,928] [2024-10-14 11:36:45,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:36:45,732 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:36:45,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:45 WrapperNode [2024-10-14 11:36:45,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:36:45,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:36:45,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:36:45,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:36:45,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:45" (1/1) ... [2024-10-14 11:36:45,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:45" (1/1) ... [2024-10-14 11:36:45,774 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2024-10-14 11:36:45,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:36:45,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:36:45,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:36:45,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:36:45,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:45" (1/1) ... [2024-10-14 11:36:45,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:45" (1/1) ... [2024-10-14 11:36:45,788 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:45" (1/1) ... [2024-10-14 11:36:45,808 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-14 11:36:45,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:45" (1/1) ... [2024-10-14 11:36:45,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:45" (1/1) ... [2024-10-14 11:36:45,819 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:45" (1/1) ... [2024-10-14 11:36:45,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:45" (1/1) ... [2024-10-14 11:36:45,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:45" (1/1) ... [2024-10-14 11:36:45,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:45" (1/1) ... [2024-10-14 11:36:45,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:36:45,836 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:36:45,836 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:36:45,836 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:36:45,837 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:45" (1/1) ... [2024-10-14 11:36:45,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:36:45,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:36:45,864 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-14 11:36:45,866 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-14 11:36:45,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:36:45,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 11:36:45,903 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:36:45,903 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:36:45,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:36:45,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:36:45,967 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:36:45,969 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:36:46,164 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 11:36:46,165 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:36:46,210 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:36:46,210 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:36:46,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:36:46 BoogieIcfgContainer [2024-10-14 11:36:46,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:36:46,212 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:36:46,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:36:46,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:36:46,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:36:45" (1/3) ... [2024-10-14 11:36:46,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303042bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:36:46, skipping insertion in model container [2024-10-14 11:36:46,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:45" (2/3) ... [2024-10-14 11:36:46,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303042bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:36:46, skipping insertion in model container [2024-10-14 11:36:46,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:36:46" (3/3) ... [2024-10-14 11:36:46,219 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-54.i [2024-10-14 11:36:46,230 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:36:46,231 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:36:46,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:36:46,285 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;@6b66ce85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:36:46,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:36:46,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 11:36:46,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 11:36:46,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:36:46,295 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:36:46,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:36:46,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:36:46,300 INFO L85 PathProgramCache]: Analyzing trace with hash -822484078, now seen corresponding path program 1 times [2024-10-14 11:36:46,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:36:46,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420888972] [2024-10-14 11:36:46,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:36:46,312 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-14 11:36:46,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:36:46,314 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-14 11:36:46,315 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-14 11:36:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:46,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 11:36:46,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:36:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 11:36:46,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:36:46,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:36:46,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420888972] [2024-10-14 11:36:46,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420888972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:36:46,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:36:46,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:36:46,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954144457] [2024-10-14 11:36:46,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:36:46,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:36:46,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:36:46,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:36:46,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:36:46,531 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 11:36:46,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:36:46,559 INFO L93 Difference]: Finished difference Result 71 states and 116 transitions. [2024-10-14 11:36:46,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:36:46,561 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 71 [2024-10-14 11:36:46,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:36:46,566 INFO L225 Difference]: With dead ends: 71 [2024-10-14 11:36:46,566 INFO L226 Difference]: Without dead ends: 34 [2024-10-14 11:36:46,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 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-14 11:36:46,573 INFO L432 NwaCegarLoop]: 44 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, 44 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-14 11:36:46,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:36:46,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-14 11:36:46,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-14 11:36:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 11:36:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2024-10-14 11:36:46,603 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 71 [2024-10-14 11:36:46,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:36:46,603 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2024-10-14 11:36:46,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 11:36:46,603 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2024-10-14 11:36:46,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 11:36:46,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:36:46,605 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:36:46,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 11:36:46,806 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-14 11:36:46,806 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:36:46,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:36:46,807 INFO L85 PathProgramCache]: Analyzing trace with hash -444207410, now seen corresponding path program 1 times [2024-10-14 11:36:46,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:36:46,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644559352] [2024-10-14 11:36:46,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:36:46,809 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-14 11:36:46,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:36:46,811 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-14 11:36:46,813 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-14 11:36:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:46,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 11:36:46,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:36:46,987 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 11:36:46,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:36:46,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:36:46,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644559352] [2024-10-14 11:36:46,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644559352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:36:46,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:36:46,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:36:46,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856639305] [2024-10-14 11:36:46,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:36:46,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:36:46,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:36:46,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:36:46,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:36:46,991 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 11:36:47,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:36:47,037 INFO L93 Difference]: Finished difference Result 68 states and 94 transitions. [2024-10-14 11:36:47,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:36:47,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 71 [2024-10-14 11:36:47,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:36:47,039 INFO L225 Difference]: With dead ends: 68 [2024-10-14 11:36:47,039 INFO L226 Difference]: Without dead ends: 35 [2024-10-14 11:36:47,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:36:47,040 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 12 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:36:47,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 105 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:36:47,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-14 11:36:47,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-10-14 11:36:47,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 11:36:47,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2024-10-14 11:36:47,050 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 71 [2024-10-14 11:36:47,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:36:47,052 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2024-10-14 11:36:47,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 11:36:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2024-10-14 11:36:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 11:36:47,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:36:47,054 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:36:47,059 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 (3)] Forceful destruction successful, exit code 0 [2024-10-14 11:36:47,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:36:47,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:36:47,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:36:47,258 INFO L85 PathProgramCache]: Analyzing trace with hash -386949108, now seen corresponding path program 1 times [2024-10-14 11:36:47,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:36:47,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369756303] [2024-10-14 11:36:47,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:36:47,260 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-14 11:36:47,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:36:47,262 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:36:47,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 11:36:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:47,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 11:36:47,384 INFO L278 TraceCheckSpWp]: Computing forward predicates...