./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-84.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 97ab114faeeb647754215ee4eabe50225e9e4c7fb0c1ec399b2dc963df906731 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:57:00,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:57:00,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:57:00,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:57:00,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:57:00,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:57:00,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:57:00,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:57:00,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:57:00,418 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:57:00,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:57:00,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:57:00,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:57:00,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:57:00,421 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:57:00,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:57:00,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:57:00,422 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:57:00,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:57:00,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:57:00,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:57:00,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:57:00,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:57:00,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:57:00,427 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:57:00,427 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:57:00,428 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:57:00,428 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:57:00,428 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:57:00,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:57:00,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:57:00,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:57:00,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:57:00,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:57:00,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:57:00,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:57:00,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:57:00,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:57:00,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:57:00,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:57:00,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:57:00,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:57:00,433 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 -> 97ab114faeeb647754215ee4eabe50225e9e4c7fb0c1ec399b2dc963df906731 [2024-11-08 23:57:00,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:57:00,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:57:00,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:57:00,706 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:57:00,707 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:57:00,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-84.i [2024-11-08 23:57:02,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:57:02,306 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:57:02,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-84.i [2024-11-08 23:57:02,318 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e388aa0b/778f41245bc943899deee671124298b4/FLAGb660c6dd8 [2024-11-08 23:57:02,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e388aa0b/778f41245bc943899deee671124298b4 [2024-11-08 23:57:02,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:57:02,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:57:02,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:57:02,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:57:02,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:57:02,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:57:02" (1/1) ... [2024-11-08 23:57:02,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc33e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:02, skipping insertion in model container [2024-11-08 23:57:02,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:57:02" (1/1) ... [2024-11-08 23:57:02,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:57:02,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-84.i[915,928] [2024-11-08 23:57:02,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:57:02,618 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:57:02,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-84.i[915,928] [2024-11-08 23:57:02,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:57:02,668 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:57:02,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:02 WrapperNode [2024-11-08 23:57:02,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:57:02,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:57:02,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:57:02,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:57:02,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:02" (1/1) ... [2024-11-08 23:57:02,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:02" (1/1) ... [2024-11-08 23:57:02,727 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-11-08 23:57:02,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:57:02,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:57:02,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:57:02,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:57:02,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:02" (1/1) ... [2024-11-08 23:57:02,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:02" (1/1) ... [2024-11-08 23:57:02,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:02" (1/1) ... [2024-11-08 23:57:02,764 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:57:02,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:02" (1/1) ... [2024-11-08 23:57:02,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:02" (1/1) ... [2024-11-08 23:57:02,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:02" (1/1) ... [2024-11-08 23:57:02,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:02" (1/1) ... [2024-11-08 23:57:02,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:02" (1/1) ... [2024-11-08 23:57:02,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:02" (1/1) ... [2024-11-08 23:57:02,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:57:02,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:57:02,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:57:02,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:57:02,790 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:02" (1/1) ... [2024-11-08 23:57:02,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:57:02,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:57:02,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:57:02,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:57:02,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:57:02,889 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:57:02,889 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:57:02,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:57:02,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:57:02,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:57:02,969 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:57:02,974 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:57:03,235 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 23:57:03,236 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:57:03,249 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:57:03,249 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:57:03,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:57:03 BoogieIcfgContainer [2024-11-08 23:57:03,249 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:57:03,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:57:03,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:57:03,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:57:03,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:57:02" (1/3) ... [2024-11-08 23:57:03,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8134b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:57:03, skipping insertion in model container [2024-11-08 23:57:03,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:02" (2/3) ... [2024-11-08 23:57:03,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8134b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:57:03, skipping insertion in model container [2024-11-08 23:57:03,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:57:03" (3/3) ... [2024-11-08 23:57:03,261 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-84.i [2024-11-08 23:57:03,273 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:57:03,274 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:57:03,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:57:03,332 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;@57d99ab1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:57:03,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:57:03,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 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-11-08 23:57:03,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 23:57:03,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:03,349 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, 1, 1, 1, 1, 1] [2024-11-08 23:57:03,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:03,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:03,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1290669553, now seen corresponding path program 1 times [2024-11-08 23:57:03,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:57:03,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257721865] [2024-11-08 23:57:03,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:03,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:57:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:03,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:57:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:03,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:57:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:03,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:57:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:03,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:57:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:03,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:57:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:57:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:03,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:57:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:03,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:57:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:03,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:57:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:03,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:57:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:03,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:57:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 23:57:03,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:57:03,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257721865] [2024-11-08 23:57:03,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257721865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:57:03,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:57:03,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:57:03,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199601944] [2024-11-08 23:57:03,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:57:03,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:57:03,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:57:03,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:57:03,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:57:03,765 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-11-08 23:57:03,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:57:03,787 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2024-11-08 23:57:03,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:57:03,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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 76 [2024-11-08 23:57:03,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:57:03,794 INFO L225 Difference]: With dead ends: 81 [2024-11-08 23:57:03,794 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 23:57:03,797 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-11-08 23:57:03,800 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:57:03,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:57:03,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 23:57:03,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-08 23:57:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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-11-08 23:57:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2024-11-08 23:57:03,838 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 76 [2024-11-08 23:57:03,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:57:03,839 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2024-11-08 23:57:03,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-11-08 23:57:03,839 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2024-11-08 23:57:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 23:57:03,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:03,842 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, 1, 1, 1, 1, 1] [2024-11-08 23:57:03,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:57:03,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:03,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:03,843 INFO L85 PathProgramCache]: Analyzing trace with hash -311629705, now seen corresponding path program 1 times [2024-11-08 23:57:03,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:57:03,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385906735] [2024-11-08 23:57:03,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:03,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:57:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:04,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:57:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:04,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:57:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:04,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:57:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:04,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:57:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:04,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:57:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:04,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:57:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:04,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:57:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:04,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:57:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:04,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:57:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:04,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:57:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:04,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:57:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 23:57:04,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:57:04,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385906735] [2024-11-08 23:57:04,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385906735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:57:04,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:57:04,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:57:04,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881905875] [2024-11-08 23:57:04,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:57:04,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:57:04,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:57:04,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:57:04,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:57:04,082 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11-08 23:57:04,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:57:04,116 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2024-11-08 23:57:04,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:57:04,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 76 [2024-11-08 23:57:04,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:57:04,119 INFO L225 Difference]: With dead ends: 77 [2024-11-08 23:57:04,119 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 23:57:04,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:57:04,121 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 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-11-08 23:57:04,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:57:04,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 23:57:04,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-08 23:57:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-11-08 23:57:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2024-11-08 23:57:04,131 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 76 [2024-11-08 23:57:04,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:57:04,132 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2024-11-08 23:57:04,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11-08 23:57:04,133 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2024-11-08 23:57:04,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 23:57:04,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:04,135 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, 1, 1, 1, 1, 1] [2024-11-08 23:57:04,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:57:04,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:04,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:04,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1463377657, now seen corresponding path program 1 times [2024-11-08 23:57:04,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:57:04,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059605290] [2024-11-08 23:57:04,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:04,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:57:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:57:04,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:57:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:57:04,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:57:04,401 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:57:04,402 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:57:04,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:57:04,408 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 23:57:04,486 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:57:04,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:57:04 BoogieIcfgContainer [2024-11-08 23:57:04,490 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:57:04,491 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:57:04,491 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:57:04,491 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:57:04,492 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:57:03" (3/4) ... [2024-11-08 23:57:04,494 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:57:04,495 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:57:04,495 INFO L158 Benchmark]: Toolchain (without parser) took 2155.28ms. Allocated memory is still 176.2MB. Free memory was 146.5MB in the beginning and 81.9MB in the end (delta: 64.6MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. [2024-11-08 23:57:04,496 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory was 88.1MB in the beginning and 87.9MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:57:04,496 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.73ms. Allocated memory is still 176.2MB. Free memory was 146.5MB in the beginning and 131.1MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:57:04,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.82ms. Allocated memory is still 176.2MB. Free memory was 131.1MB in the beginning and 127.6MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:57:04,497 INFO L158 Benchmark]: Boogie Preprocessor took 56.67ms. Allocated memory is still 176.2MB. Free memory was 127.6MB in the beginning and 121.5MB in the end (delta: 6.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:57:04,498 INFO L158 Benchmark]: RCFGBuilder took 463.84ms. Allocated memory is still 176.2MB. Free memory was 121.5MB in the beginning and 103.8MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 23:57:04,498 INFO L158 Benchmark]: TraceAbstraction took 1234.64ms. Allocated memory is still 176.2MB. Free memory was 103.1MB in the beginning and 81.9MB in the end (delta: 21.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-11-08 23:57:04,499 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 176.2MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:57:04,501 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.16ms. Allocated memory is still 125.8MB. Free memory was 88.1MB in the beginning and 87.9MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.73ms. Allocated memory is still 176.2MB. Free memory was 146.5MB in the beginning and 131.1MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.82ms. Allocated memory is still 176.2MB. Free memory was 131.1MB in the beginning and 127.6MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.67ms. Allocated memory is still 176.2MB. Free memory was 127.6MB in the beginning and 121.5MB in the end (delta: 6.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 463.84ms. Allocated memory is still 176.2MB. Free memory was 121.5MB in the beginning and 103.8MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1234.64ms. Allocated memory is still 176.2MB. Free memory was 103.1MB in the beginning and 81.9MB in the end (delta: 21.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 176.2MB. Free memory is still 81.9MB. 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 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] unsigned char var_1_4 = 25; [L24] unsigned char var_1_5 = 64; [L25] unsigned char var_1_6 = 8; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 10; [L28] float var_1_9 = 9.6; [L29] float var_1_10 = 99.08; [L30] float var_1_11 = 63.4; [L31] float var_1_12 = 32.125; [L32] signed long int var_1_13 = -8; [L33] signed short int var_1_14 = -2; VAL [isInitial=0, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=25, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L88] isInitial = 1 [L89] FCALL initially() [L90] COND TRUE 1 [L91] FCALL updateLastVariables() [L92] CALL updateVariables() [L62] var_1_4 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L63] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L64] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L64] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L65] var_1_5 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L66] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L67] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L67] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L68] var_1_6 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_7=0, var_1_8=10, var_1_9=48/5] [L69] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_7=0, var_1_8=10, var_1_9=48/5] [L70] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L70] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L71] var_1_7 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_8=10, var_1_9=48/5] [L72] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_8=10, var_1_9=48/5] [L73] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L73] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L74] var_1_10 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L75] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L76] var_1_11 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L77] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L78] var_1_12 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L79] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L92] RET updateVariables() [L93] CALL step() [L37] unsigned char stepLocal_1 = var_1_4; VAL [isInitial=1, stepLocal_1=8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L38] COND TRUE var_1_5 > stepLocal_1 [L39] var_1_8 = (128 - ((((10) > (var_1_5)) ? (10) : (var_1_5)))) VAL [isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L41] var_1_13 = var_1_7 [L42] var_1_14 = var_1_7 [L43] signed short int stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=9, var_1_13=9, var_1_14=9, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L44] COND FALSE !(var_1_14 != stepLocal_0) [L47] var_1_1 = ((((((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) < (var_1_7)) ? (((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) : (var_1_7))) VAL [isInitial=1, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L49] signed long int stepLocal_3 = var_1_13; [L50] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, stepLocal_2=8, stepLocal_3=9, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L51] COND FALSE !((var_1_10 * var_1_11) > 16.75f) VAL [isInitial=1, stepLocal_2=8, stepLocal_3=9, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L93] RET step() [L94] CALL, EXPR property() [L84-L85] return (((((var_1_14 != var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + ((((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) > (var_1_7)) ? (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) : (var_1_7)))))) : (var_1_1 == ((unsigned char) ((((((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) < (var_1_7)) ? (((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) : (var_1_7)))))) && ((var_1_5 > var_1_4) ? (var_1_8 == ((unsigned char) (128 - ((((10) > (var_1_5)) ? (10) : (var_1_5)))))) : 1)) && (((var_1_10 * var_1_11) > 16.75f) ? ((var_1_7 <= var_1_1) ? ((-8 > var_1_13) ? (var_1_9 == ((float) var_1_12)) : 1) : (var_1_9 == ((float) var_1_12))) : 1)) && (var_1_13 == ((signed long int) var_1_7))) && (var_1_14 == ((signed short int) var_1_7)) ; VAL [\result=0, isInitial=1, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L19] reach_error() VAL [isInitial=1, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 157 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 108 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 152 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-11-08 23:57:04,530 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-84.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 97ab114faeeb647754215ee4eabe50225e9e4c7fb0c1ec399b2dc963df906731 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:57:06,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:57:06,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:57:06,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:57:06,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:57:06,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:57:06,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:57:06,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:57:06,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:57:06,823 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:57:06,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:57:06,823 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:57:06,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:57:06,825 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:57:06,826 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:57:06,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:57:06,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:57:06,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:57:06,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:57:06,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:57:06,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:57:06,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:57:06,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:57:06,832 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:57:06,832 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:57:06,833 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:57:06,833 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:57:06,833 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:57:06,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:57:06,833 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:57:06,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:57:06,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:57:06,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:57:06,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:57:06,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:57:06,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:57:06,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:57:06,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:57:06,837 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:57:06,838 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:57:06,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:57:06,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:57:06,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:57:06,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:57:06,839 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 -> 97ab114faeeb647754215ee4eabe50225e9e4c7fb0c1ec399b2dc963df906731 [2024-11-08 23:57:07,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:57:07,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:57:07,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:57:07,193 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:57:07,193 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:57:07,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-84.i [2024-11-08 23:57:08,697 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:57:08,931 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:57:08,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-84.i [2024-11-08 23:57:08,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ae371e6/371ea55856b24a14ac9a72a99e729db6/FLAGda7c33c44 [2024-11-08 23:57:08,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ae371e6/371ea55856b24a14ac9a72a99e729db6 [2024-11-08 23:57:08,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:57:08,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:57:08,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:57:08,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:57:08,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:57:08,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:57:08" (1/1) ... [2024-11-08 23:57:08,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74acc14b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:08, skipping insertion in model container [2024-11-08 23:57:08,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:57:08" (1/1) ... [2024-11-08 23:57:09,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:57:09,186 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-84.i[915,928] [2024-11-08 23:57:09,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:57:09,282 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:57:09,295 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-84.i[915,928] [2024-11-08 23:57:09,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:57:09,343 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:57:09,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:09 WrapperNode [2024-11-08 23:57:09,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:57:09,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:57:09,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:57:09,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:57:09,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:09" (1/1) ... [2024-11-08 23:57:09,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:09" (1/1) ... [2024-11-08 23:57:09,395 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-11-08 23:57:09,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:57:09,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:57:09,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:57:09,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:57:09,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:09" (1/1) ... [2024-11-08 23:57:09,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:09" (1/1) ... [2024-11-08 23:57:09,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:09" (1/1) ... [2024-11-08 23:57:09,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-11-08 23:57:09,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:09" (1/1) ... [2024-11-08 23:57:09,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:09" (1/1) ... [2024-11-08 23:57:09,448 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:09" (1/1) ... [2024-11-08 23:57:09,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:09" (1/1) ... [2024-11-08 23:57:09,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:09" (1/1) ... [2024-11-08 23:57:09,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:09" (1/1) ... [2024-11-08 23:57:09,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:57:09,469 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:57:09,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:57:09,469 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:57:09,470 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:09" (1/1) ... [2024-11-08 23:57:09,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:57:09,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:57:09,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:57:09,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:57:09,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:57:09,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:57:09,552 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:57:09,552 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:57:09,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:57:09,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:57:09,645 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:57:09,647 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:57:10,429 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 23:57:10,429 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:57:10,444 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:57:10,444 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:57:10,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:57:10 BoogieIcfgContainer [2024-11-08 23:57:10,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:57:10,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:57:10,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:57:10,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:57:10,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:57:08" (1/3) ... [2024-11-08 23:57:10,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eac7a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:57:10, skipping insertion in model container [2024-11-08 23:57:10,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:09" (2/3) ... [2024-11-08 23:57:10,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eac7a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:57:10, skipping insertion in model container [2024-11-08 23:57:10,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:57:10" (3/3) ... [2024-11-08 23:57:10,454 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-84.i [2024-11-08 23:57:10,470 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:57:10,471 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:57:10,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:57:10,537 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;@669ff5d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:57:10,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:57:10,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 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-11-08 23:57:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 23:57:10,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:10,557 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, 1, 1, 1, 1, 1] [2024-11-08 23:57:10,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:10,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:10,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1290669553, now seen corresponding path program 1 times [2024-11-08 23:57:10,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:57:10,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535816859] [2024-11-08 23:57:10,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:10,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:57:10,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:57:10,585 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:57:10,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:57:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:10,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:57:10,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:57:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-08 23:57:10,902 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:57:10,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:57:10,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535816859] [2024-11-08 23:57:10,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535816859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:57:10,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:57:10,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:57:10,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022388446] [2024-11-08 23:57:10,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:57:10,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:57:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:57:10,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:57:10,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:57:10,938 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-08 23:57:10,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:57:10,964 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2024-11-08 23:57:10,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:57:10,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2024-11-08 23:57:10,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:57:10,991 INFO L225 Difference]: With dead ends: 81 [2024-11-08 23:57:10,991 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 23:57:10,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:57:11,001 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:57:11,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:57:11,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 23:57:11,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-08 23:57:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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-11-08 23:57:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2024-11-08 23:57:11,049 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 76 [2024-11-08 23:57:11,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:57:11,050 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2024-11-08 23:57:11,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-08 23:57:11,050 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2024-11-08 23:57:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 23:57:11,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:11,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, 1, 1, 1, 1, 1] [2024-11-08 23:57:11,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 23:57:11,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:57:11,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:11,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:11,257 INFO L85 PathProgramCache]: Analyzing trace with hash -311629705, now seen corresponding path program 1 times [2024-11-08 23:57:11,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:57:11,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941639179] [2024-11-08 23:57:11,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:11,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:57:11,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:57:11,263 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:57:11,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:57:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:11,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 23:57:11,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:57:11,537 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 23:57:11,538 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:57:11,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:57:11,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941639179] [2024-11-08 23:57:11,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941639179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:57:11,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:57:11,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:57:11,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282048271] [2024-11-08 23:57:11,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:57:11,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:57:11,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:57:11,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:57:11,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:57:11,542 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11-08 23:57:11,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:57:11,648 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2024-11-08 23:57:11,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:57:11,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 76 [2024-11-08 23:57:11,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:57:11,657 INFO L225 Difference]: With dead ends: 77 [2024-11-08 23:57:11,657 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 23:57:11,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:57:11,660 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:57:11,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:57:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 23:57:11,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-08 23:57:11,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-11-08 23:57:11,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2024-11-08 23:57:11,672 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 76 [2024-11-08 23:57:11,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:57:11,673 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2024-11-08 23:57:11,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11-08 23:57:11,674 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2024-11-08 23:57:11,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 23:57:11,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:11,676 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, 1, 1, 1, 1, 1] [2024-11-08 23:57:11,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 23:57:11,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:57:11,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:11,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:11,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1463377657, now seen corresponding path program 1 times [2024-11-08 23:57:11,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:57:11,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418382586] [2024-11-08 23:57:11,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:11,880 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:57:11,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:57:11,881 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:57:11,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 23:57:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:12,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 23:57:12,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:58:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 23:58:27,565 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:58:27,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:58:27,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418382586] [2024-11-08 23:58:27,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418382586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:58:27,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:58:27,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 23:58:27,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288106273] [2024-11-08 23:58:27,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:58:27,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:58:27,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:58:27,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:58:27,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:58:27,568 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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)