./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-64.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-64.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 5cfd8244917467985e1ec9aab123eb53d7984fa345597a11e6475c4a60dfdb5a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:54:30,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:54:30,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:54:30,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:54:30,266 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:54:30,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:54:30,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:54:30,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:54:30,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:54:30,295 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:54:30,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:54:30,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:54:30,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:54:30,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:54:30,296 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:54:30,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:54:30,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:54:30,297 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:54:30,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:54:30,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:54:30,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:54:30,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:54:30,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:54:30,299 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:54:30,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:54:30,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:54:30,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:54:30,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:54:30,300 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:54:30,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:54:30,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:54:30,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:54:30,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:54:30,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:54:30,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:54:30,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:54:30,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:54:30,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:54:30,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:54:30,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:54:30,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:54:30,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:54:30,307 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 -> 5cfd8244917467985e1ec9aab123eb53d7984fa345597a11e6475c4a60dfdb5a [2024-11-08 23:54:30,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:54:30,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:54:30,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:54:30,542 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:54:30,542 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:54:30,543 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-64.i [2024-11-08 23:54:31,852 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:54:32,023 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:54:32,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-64.i [2024-11-08 23:54:32,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/797ea6485/c276717efc6d437591df94b2ef395457/FLAG1f3e671b8 [2024-11-08 23:54:32,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/797ea6485/c276717efc6d437591df94b2ef395457 [2024-11-08 23:54:32,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:54:32,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:54:32,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:54:32,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:54:32,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:54:32,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:54:32" (1/1) ... [2024-11-08 23:54:32,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ce6113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:32, skipping insertion in model container [2024-11-08 23:54:32,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:54:32" (1/1) ... [2024-11-08 23:54:32,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:54:32,194 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-64.i[915,928] [2024-11-08 23:54:32,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:54:32,234 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:54:32,243 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-64.i[915,928] [2024-11-08 23:54:32,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:54:32,276 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:54:32,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:32 WrapperNode [2024-11-08 23:54:32,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:54:32,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:54:32,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:54:32,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:54:32,284 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:54:32" (1/1) ... [2024-11-08 23:54:32,291 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:54:32" (1/1) ... [2024-11-08 23:54:32,318 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-11-08 23:54:32,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:54:32,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:54:32,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:54:32,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:54:32,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:32" (1/1) ... [2024-11-08 23:54:32,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:32" (1/1) ... [2024-11-08 23:54:32,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:32" (1/1) ... [2024-11-08 23:54:32,349 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:54:32,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:32" (1/1) ... [2024-11-08 23:54:32,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:32" (1/1) ... [2024-11-08 23:54:32,354 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:32" (1/1) ... [2024-11-08 23:54:32,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:32" (1/1) ... [2024-11-08 23:54:32,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:32" (1/1) ... [2024-11-08 23:54:32,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:32" (1/1) ... [2024-11-08 23:54:32,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:54:32,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:54:32,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:54:32,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:54:32,362 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:32" (1/1) ... [2024-11-08 23:54:32,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:54:32,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:54:32,406 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:54:32,417 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:54:32,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:54:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:54:32,488 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:54:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:54:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:54:32,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:54:32,577 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:54:32,578 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:54:32,861 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-08 23:54:32,862 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:54:32,882 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:54:32,884 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:54:32,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:54:32 BoogieIcfgContainer [2024-11-08 23:54:32,885 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:54:32,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:54:32,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:54:32,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:54:32,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:54:32" (1/3) ... [2024-11-08 23:54:32,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2038e6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:54:32, skipping insertion in model container [2024-11-08 23:54:32,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:32" (2/3) ... [2024-11-08 23:54:32,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2038e6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:54:32, skipping insertion in model container [2024-11-08 23:54:32,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:54:32" (3/3) ... [2024-11-08 23:54:32,894 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-64.i [2024-11-08 23:54:32,908 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:54:32,908 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:54:32,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:54:32,960 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;@48f83fbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:54:32,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:54:32,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:54:32,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 23:54:32,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:54:32,972 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:54:32,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:54:32,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:54:32,978 INFO L85 PathProgramCache]: Analyzing trace with hash -531792171, now seen corresponding path program 1 times [2024-11-08 23:54:32,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:54:32,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625027588] [2024-11-08 23:54:32,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:54:32,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:54:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:33,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:54:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:33,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:54:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:33,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:54:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:33,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:54:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:33,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:54:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:33,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:54:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:33,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:54:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:33,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:54:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:33,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:54:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:33,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:54:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:33,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:54:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:33,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:54:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:33,277 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 23:54:33,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:54:33,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625027588] [2024-11-08 23:54:33,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625027588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:54:33,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:54:33,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:54:33,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844633131] [2024-11-08 23:54:33,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:54:33,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:54:33,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:54:33,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:54:33,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:54:33,309 INFO L87 Difference]: Start difference. First operand has 54 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:54:33,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:54:33,331 INFO L93 Difference]: Finished difference Result 99 states and 160 transitions. [2024-11-08 23:54:33,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:54:33,334 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2024-11-08 23:54:33,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:54:33,340 INFO L225 Difference]: With dead ends: 99 [2024-11-08 23:54:33,341 INFO L226 Difference]: Without dead ends: 48 [2024-11-08 23:54:33,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:54:33,347 INFO L432 NwaCegarLoop]: 67 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, 67 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:54:33,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:54:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-08 23:54:33,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-08 23:54:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:54:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2024-11-08 23:54:33,386 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 82 [2024-11-08 23:54:33,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:54:33,387 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2024-11-08 23:54:33,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:54:33,388 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2024-11-08 23:54:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 23:54:33,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:54:33,391 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:54:33,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:54:33,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:54:33,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:54:33,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1140243371, now seen corresponding path program 1 times [2024-11-08 23:54:33,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:54:33,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592553409] [2024-11-08 23:54:33,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:54:33,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:54:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:34,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:54:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:34,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:54:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:34,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:54:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:34,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:54:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:34,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:54:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:34,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:54:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:34,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:54:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:34,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:54:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:34,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:54:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:34,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:54:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:34,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:54:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:34,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:54:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 23:54:34,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:54:34,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592553409] [2024-11-08 23:54:34,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592553409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:54:34,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:54:34,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:54:34,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428760981] [2024-11-08 23:54:34,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:54:34,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:54:34,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:54:34,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:54:34,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:54:34,095 INFO L87 Difference]: Start difference. First operand 48 states and 67 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 23:54:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:54:34,335 INFO L93 Difference]: Finished difference Result 153 states and 216 transitions. [2024-11-08 23:54:34,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:54:34,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2024-11-08 23:54:34,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:54:34,338 INFO L225 Difference]: With dead ends: 153 [2024-11-08 23:54:34,340 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 23:54:34,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:54:34,342 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 137 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:54:34,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 196 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:54:34,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 23:54:34,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 78. [2024-11-08 23:54:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 54 states have internal predecessors, (67), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 23:54:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2024-11-08 23:54:34,369 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 82 [2024-11-08 23:54:34,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:54:34,369 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 111 transitions. [2024-11-08 23:54:34,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 23:54:34,370 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions. [2024-11-08 23:54:34,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 23:54:34,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:54:34,373 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:54:34,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:54:34,374 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:54:34,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:54:34,374 INFO L85 PathProgramCache]: Analyzing trace with hash -385616337, now seen corresponding path program 1 times [2024-11-08 23:54:34,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:54:34,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877114113] [2024-11-08 23:54:34,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:54:34,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:54:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:54:34,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1122429590] [2024-11-08 23:54:34,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:54:34,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:54:34,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:54:34,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:54:34,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:54:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:34,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 23:54:34,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:54:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 23:54:34,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:54:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 23:54:34,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:54:34,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877114113] [2024-11-08 23:54:34,917 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 23:54:34,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122429590] [2024-11-08 23:54:34,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122429590] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 23:54:34,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 23:54:34,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-08 23:54:34,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374278202] [2024-11-08 23:54:34,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:54:34,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:54:34,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:54:34,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:54:34,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:54:34,920 INFO L87 Difference]: Start difference. First operand 78 states and 111 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 23:54:35,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:54:35,192 INFO L93 Difference]: Finished difference Result 147 states and 203 transitions. [2024-11-08 23:54:35,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:54:35,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-11-08 23:54:35,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:54:35,195 INFO L225 Difference]: With dead ends: 147 [2024-11-08 23:54:35,195 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 23:54:35,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:54:35,196 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 23 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:54:35,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 146 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:54:35,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 23:54:35,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2024-11-08 23:54:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 23:54:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 110 transitions. [2024-11-08 23:54:35,208 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 110 transitions. Word has length 83 [2024-11-08 23:54:35,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:54:35,208 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 110 transitions. [2024-11-08 23:54:35,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 23:54:35,209 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 110 transitions. [2024-11-08 23:54:35,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 23:54:35,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:54:35,210 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:54:35,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:54:35,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:54:35,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:54:35,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:54:35,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1389391025, now seen corresponding path program 1 times [2024-11-08 23:54:35,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:54:35,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255128678] [2024-11-08 23:54:35,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:54:35,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:54:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:54:35,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1022108413] [2024-11-08 23:54:35,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:54:35,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:54:35,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:54:35,434 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:54:35,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 23:54:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:54:35,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:54:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:54:35,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:54:35,544 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:54:35,544 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:54:35,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 23:54:35,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 23:54:35,749 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 23:54:35,785 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:54:35,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:54:35 BoogieIcfgContainer [2024-11-08 23:54:35,787 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:54:35,787 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:54:35,788 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:54:35,788 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:54:35,788 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:54:32" (3/4) ... [2024-11-08 23:54:35,790 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:54:35,791 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:54:35,791 INFO L158 Benchmark]: Toolchain (without parser) took 3745.10ms. Allocated memory was 142.6MB in the beginning and 274.7MB in the end (delta: 132.1MB). Free memory was 72.2MB in the beginning and 139.9MB in the end (delta: -67.7MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2024-11-08 23:54:35,791 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:54:35,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.42ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 57.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:54:35,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.96ms. Allocated memory is still 142.6MB. Free memory was 57.7MB in the beginning and 54.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:54:35,792 INFO L158 Benchmark]: Boogie Preprocessor took 42.12ms. Allocated memory is still 142.6MB. Free memory was 54.7MB in the beginning and 50.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:54:35,792 INFO L158 Benchmark]: RCFGBuilder took 523.36ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 50.8MB in the beginning and 148.9MB in the end (delta: -98.1MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-11-08 23:54:35,793 INFO L158 Benchmark]: TraceAbstraction took 2900.36ms. Allocated memory was 197.1MB in the beginning and 274.7MB in the end (delta: 77.6MB). Free memory was 148.9MB in the beginning and 141.0MB in the end (delta: 7.9MB). Peak memory consumption was 85.5MB. Max. memory is 16.1GB. [2024-11-08 23:54:35,793 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 274.7MB. Free memory was 141.0MB in the beginning and 139.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:54:35,794 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.42ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 57.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.96ms. Allocated memory is still 142.6MB. Free memory was 57.7MB in the beginning and 54.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.12ms. Allocated memory is still 142.6MB. Free memory was 54.7MB in the beginning and 50.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 523.36ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 50.8MB in the beginning and 148.9MB in the end (delta: -98.1MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2900.36ms. Allocated memory was 197.1MB in the beginning and 274.7MB in the end (delta: 77.6MB). Free memory was 148.9MB in the beginning and 141.0MB in the end (delta: 7.9MB). Peak memory consumption was 85.5MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 274.7MB. Free memory was 141.0MB in the beginning and 139.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 0.9; [L23] unsigned long int var_1_3 = 2941876006; [L24] double var_1_5 = 127.422; [L25] unsigned short int var_1_6 = 10; [L26] unsigned char var_1_7 = 1; [L27] unsigned long int var_1_9 = 4; [L28] unsigned short int var_1_11 = 44699; [L29] signed short int var_1_13 = 2; [L30] unsigned char var_1_15 = 0; [L31] unsigned char var_1_16 = 16; [L32] float var_1_17 = 8.125; VAL [isInitial=0, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2941876006, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L86] isInitial = 1 [L87] FCALL initially() [L88] COND TRUE 1 [L89] FCALL updateLastVariables() [L90] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_ulong() [L61] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L61] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L62] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L62] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L63] var_1_5 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=1, var_1_9=4] [L64] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=1, var_1_9=4] [L65] var_1_7 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_9=4] [L66] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_9=4] [L67] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=4] [L67] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=4] [L68] var_1_9 = __VERIFIER_nondet_ulong() [L69] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0] [L69] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0] [L70] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0] [L70] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0] [L71] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L71] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L72] var_1_11 = __VERIFIER_nondet_ushort() [L73] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L73] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L74] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L74] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L75] var_1_16 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L76] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L77] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L77] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L90] RET updateVariables() [L91] CALL step() [L36] var_1_15 = var_1_16 [L37] var_1_17 = var_1_5 VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=2147483647, var_1_5=2, var_1_6=10, var_1_7=0, var_1_9=1] [L38] EXPR var_1_15 & var_1_15 VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=2147483647, var_1_5=2, var_1_6=10, var_1_7=0, var_1_9=1] [L38] unsigned long int stepLocal_2 = var_1_3 * (var_1_15 & var_1_15); [L39] COND FALSE !(\read(var_1_7)) [L46] var_1_6 = (((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))) + 1) VAL [isInitial=1, stepLocal_2=0, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L48] var_1_13 = var_1_15 [L49] signed long int stepLocal_1 = var_1_6 * var_1_15; [L50] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L51] COND TRUE stepLocal_0 <= (var_1_3 - var_1_6) VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L52] COND FALSE !(var_1_3 < stepLocal_1) [L55] var_1_1 = var_1_5 VAL [isInitial=1, stepLocal_2=0, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L91] RET step() [L92] CALL, EXPR property() [L82] EXPR ((var_1_15 <= (var_1_3 - var_1_6)) ? ((var_1_3 < (var_1_6 * var_1_15)) ? (var_1_1 == ((double) var_1_5)) : (var_1_1 == ((double) var_1_5))) : 1) && (var_1_7 ? (((var_1_3 * (var_1_15 & var_1_15)) <= (var_1_15 / var_1_9)) ? (var_1_6 == ((unsigned short int) (47342 - var_1_15))) : (var_1_6 == ((unsigned short int) (var_1_11 - ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))))) : (var_1_6 == ((unsigned short int) (((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))) + 1)))) VAL [isInitial=1, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L82-L83] return (((((var_1_15 <= (var_1_3 - var_1_6)) ? ((var_1_3 < (var_1_6 * var_1_15)) ? (var_1_1 == ((double) var_1_5)) : (var_1_1 == ((double) var_1_5))) : 1) && (var_1_7 ? (((var_1_3 * (var_1_15 & var_1_15)) <= (var_1_15 / var_1_9)) ? (var_1_6 == ((unsigned short int) (47342 - var_1_15))) : (var_1_6 == ((unsigned short int) (var_1_11 - ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))))) : (var_1_6 == ((unsigned short int) (((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))) + 1))))) && (var_1_13 == ((signed short int) var_1_15))) && (var_1_15 == ((unsigned char) var_1_16))) && (var_1_17 == ((float) var_1_5)) ; [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 409 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 204 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 326 ConstructedInterpolants, 3 QuantifiedInterpolants, 800 SizeOfPredicates, 4 NumberOfNonLiveVariables, 202 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1023/1056 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:54:35,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-64.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 5cfd8244917467985e1ec9aab123eb53d7984fa345597a11e6475c4a60dfdb5a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:54:37,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:54:37,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:54:37,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:54:37,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:54:37,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:54:37,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:54:37,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:54:37,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:54:37,790 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:54:37,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:54:37,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:54:37,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:54:37,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:54:37,791 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:54:37,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:54:37,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:54:37,791 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:54:37,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:54:37,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:54:37,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:54:37,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:54:37,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:54:37,797 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:54:37,801 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:54:37,801 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:54:37,801 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:54:37,801 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:54:37,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:54:37,802 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:54:37,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:54:37,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:54:37,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:54:37,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:54:37,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:54:37,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:54:37,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:54:37,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:54:37,803 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:54:37,803 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:54:37,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:54:37,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:54:37,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:54:37,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:54:37,805 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 -> 5cfd8244917467985e1ec9aab123eb53d7984fa345597a11e6475c4a60dfdb5a [2024-11-08 23:54:38,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:54:38,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:54:38,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:54:38,125 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:54:38,125 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:54:38,126 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-64.i [2024-11-08 23:54:39,519 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:54:39,696 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:54:39,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-64.i [2024-11-08 23:54:39,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/822d0769a/023cfa5d108649fca3a61f14c4535b33/FLAGbc86d5700 [2024-11-08 23:54:39,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/822d0769a/023cfa5d108649fca3a61f14c4535b33 [2024-11-08 23:54:39,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:54:39,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:54:39,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:54:39,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:54:39,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:54:39,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:54:39" (1/1) ... [2024-11-08 23:54:39,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1807bffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:39, skipping insertion in model container [2024-11-08 23:54:39,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:54:39" (1/1) ... [2024-11-08 23:54:39,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:54:39,928 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-64.i[915,928] [2024-11-08 23:54:39,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:54:39,980 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:54:39,990 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-64.i[915,928] [2024-11-08 23:54:40,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:54:40,030 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:54:40,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:40 WrapperNode [2024-11-08 23:54:40,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:54:40,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:54:40,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:54:40,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:54:40,037 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:54:40" (1/1) ... [2024-11-08 23:54:40,047 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:54:40" (1/1) ... [2024-11-08 23:54:40,069 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-11-08 23:54:40,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:54:40,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:54:40,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:54:40,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:54:40,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:40" (1/1) ... [2024-11-08 23:54:40,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:40" (1/1) ... [2024-11-08 23:54:40,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:40" (1/1) ... [2024-11-08 23:54:40,102 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:54:40,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:40" (1/1) ... [2024-11-08 23:54:40,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:40" (1/1) ... [2024-11-08 23:54:40,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:40" (1/1) ... [2024-11-08 23:54:40,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:40" (1/1) ... [2024-11-08 23:54:40,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:40" (1/1) ... [2024-11-08 23:54:40,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:40" (1/1) ... [2024-11-08 23:54:40,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:54:40,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:54:40,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:54:40,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:54:40,127 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:40" (1/1) ... [2024-11-08 23:54:40,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:54:40,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:54:40,163 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:54:40,165 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:54:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:54:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:54:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:54:40,198 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:54:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:54:40,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:54:40,254 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:54:40,255 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:54:40,658 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 23:54:40,658 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:54:40,670 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:54:40,671 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:54:40,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:54:40 BoogieIcfgContainer [2024-11-08 23:54:40,671 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:54:40,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:54:40,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:54:40,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:54:40,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:54:39" (1/3) ... [2024-11-08 23:54:40,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648c596a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:54:40, skipping insertion in model container [2024-11-08 23:54:40,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:40" (2/3) ... [2024-11-08 23:54:40,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648c596a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:54:40, skipping insertion in model container [2024-11-08 23:54:40,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:54:40" (3/3) ... [2024-11-08 23:54:40,680 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-64.i [2024-11-08 23:54:40,692 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:54:40,693 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:54:40,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:54:40,763 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;@3e3b9115, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:54:40,764 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:54:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:54:40,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 23:54:40,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:54:40,776 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:54:40,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:54:40,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:54:40,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1855080281, now seen corresponding path program 1 times [2024-11-08 23:54:40,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:54:40,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269415913] [2024-11-08 23:54:40,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:54:40,796 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:54:40,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:54:40,801 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:54:40,803 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:54:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:40,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:54:40,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:54:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-08 23:54:40,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:54:40,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:54:40,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269415913] [2024-11-08 23:54:40,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269415913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:54:40,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:54:40,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:54:40,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304850885] [2024-11-08 23:54:40,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:54:40,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:54:40,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:54:41,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:54:41,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:54:41,017 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:54:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:54:41,037 INFO L93 Difference]: Finished difference Result 77 states and 126 transitions. [2024-11-08 23:54:41,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:54:41,039 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2024-11-08 23:54:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:54:41,045 INFO L225 Difference]: With dead ends: 77 [2024-11-08 23:54:41,045 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 23:54:41,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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:54:41,052 INFO L432 NwaCegarLoop]: 53 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, 53 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:54:41,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:54:41,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 23:54:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-08 23:54:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:54:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-08 23:54:41,083 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 78 [2024-11-08 23:54:41,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:54:41,083 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-08 23:54:41,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:54:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-08 23:54:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 23:54:41,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:54:41,086 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:54:41,094 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:54:41,287 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:54:41,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:54:41,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:54:41,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1041026265, now seen corresponding path program 1 times [2024-11-08 23:54:41,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:54:41,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029334854] [2024-11-08 23:54:41,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:54:41,289 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:54:41,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:54:41,295 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:54:41,298 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:54:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:41,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:54:41,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:54:41,733 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 23:54:41,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:54:41,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:54:41,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029334854] [2024-11-08 23:54:41,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029334854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:54:41,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [800601011] [2024-11-08 23:54:41,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:54:41,795 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 23:54:41,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 23:54:41,798 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 23:54:41,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-08 23:54:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:42,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:54:42,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:54:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 23:54:42,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:54:42,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [800601011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:54:42,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:54:42,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-08 23:54:42,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192397990] [2024-11-08 23:54:42,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:54:42,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:54:42,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:54:42,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:54:42,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:54:42,450 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:54:43,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:54:43,105 INFO L93 Difference]: Finished difference Result 90 states and 121 transitions. [2024-11-08 23:54:43,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:54:43,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2024-11-08 23:54:43,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:54:43,115 INFO L225 Difference]: With dead ends: 90 [2024-11-08 23:54:43,115 INFO L226 Difference]: Without dead ends: 55 [2024-11-08 23:54:43,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:54:43,116 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 39 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 23:54:43,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 89 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 23:54:43,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-08 23:54:43,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2024-11-08 23:54:43,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:54:43,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2024-11-08 23:54:43,128 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 78 [2024-11-08 23:54:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:54:43,129 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2024-11-08 23:54:43,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:54:43,129 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2024-11-08 23:54:43,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 23:54:43,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:54:43,130 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:54:43,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-08 23:54:43,338 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:54:43,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:54:43,532 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:54:43,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:54:43,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1971482828, now seen corresponding path program 1 times [2024-11-08 23:54:43,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:54:43,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573082312] [2024-11-08 23:54:43,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:54:43,533 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:54:43,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:54:43,537 INFO L229 MonitoredProcess]: Starting monitored process 5 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:54:43,538 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 (5)] Waiting until timeout for monitored process [2024-11-08 23:54:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:43,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:54:43,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:54:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 23:54:43,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:54:44,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:54:44,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573082312] [2024-11-08 23:54:44,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573082312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:54:44,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [661459965] [2024-11-08 23:54:44,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:54:44,005 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 23:54:44,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 23:54:44,011 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 23:54:44,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-08 23:54:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:44,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:54:44,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:54:44,521 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 23:54:44,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:54:44,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [661459965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:54:44,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:54:44,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-08 23:54:44,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133753581] [2024-11-08 23:54:44,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:54:44,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:54:44,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:54:44,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:54:44,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:54:44,575 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:54:45,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:54:45,879 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2024-11-08 23:54:45,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:54:45,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2024-11-08 23:54:45,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:54:45,892 INFO L225 Difference]: With dead ends: 83 [2024-11-08 23:54:45,892 INFO L226 Difference]: Without dead ends: 44 [2024-11-08 23:54:45,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:54:45,894 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:54:45,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 99 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 23:54:45,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-08 23:54:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2024-11-08 23:54:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:54:45,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2024-11-08 23:54:45,907 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 79 [2024-11-08 23:54:45,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:54:45,908 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2024-11-08 23:54:45,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:54:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2024-11-08 23:54:45,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 23:54:45,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:54:45,911 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:54:45,919 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 (5)] Ended with exit code 0 [2024-11-08 23:54:46,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-08 23:54:46,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-08 23:54:46,315 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:54:46,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:54:46,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1973329870, now seen corresponding path program 1 times [2024-11-08 23:54:46,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:54:46,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13581914] [2024-11-08 23:54:46,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:54:46,316 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:54:46,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:54:46,319 INFO L229 MonitoredProcess]: Starting monitored process 7 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:54:46,320 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 (7)] Waiting until timeout for monitored process [2024-11-08 23:54:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:46,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 23:54:46,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:55:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-08 23:55:03,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:56:11,861 WARN L286 SmtUtils]: Spent 13.57s on a formula simplification that was a NOOP. DAG size: 120 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)