./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.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 76e63db8a1f11506a4aa82d105c50692fc5fb5205570dd5e3435037592a7b2ae --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:12:29,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:12:29,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:12:29,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:12:29,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:12:29,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:12:29,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:12:29,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:12:29,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:12:29,406 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:12:29,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:12:29,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:12:29,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:12:29,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:12:29,410 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:12:29,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:12:29,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:12:29,411 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:12:29,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:12:29,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:12:29,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:12:29,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:12:29,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:12:29,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:12:29,413 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:12:29,413 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:12:29,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:12:29,413 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:12:29,414 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:12:29,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:12:29,414 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:12:29,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:12:29,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:12:29,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:12:29,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:12:29,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:12:29,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:12:29,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:12:29,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:12:29,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:12:29,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:12:29,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:12:29,432 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 -> 76e63db8a1f11506a4aa82d105c50692fc5fb5205570dd5e3435037592a7b2ae [2024-11-22 10:12:29,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:12:29,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:12:29,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:12:29,688 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:12:29,689 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:12:29,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i [2024-11-22 10:12:31,252 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:12:31,452 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:12:31,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i [2024-11-22 10:12:31,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abf1f450e/7d4be0820f5141558bf09321e29b591c/FLAG58782ff56 [2024-11-22 10:12:31,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abf1f450e/7d4be0820f5141558bf09321e29b591c [2024-11-22 10:12:31,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:12:31,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:12:31,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:12:31,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:12:31,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:12:31,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:12:31" (1/1) ... [2024-11-22 10:12:31,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f06ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:31, skipping insertion in model container [2024-11-22 10:12:31,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:12:31" (1/1) ... [2024-11-22 10:12:31,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:12:31,678 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_floatingpointinfluence_no-floats_file-88.i[916,929] [2024-11-22 10:12:31,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:12:31,729 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:12:31,741 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_floatingpointinfluence_no-floats_file-88.i[916,929] [2024-11-22 10:12:31,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:12:31,791 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:12:31,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:31 WrapperNode [2024-11-22 10:12:31,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:12:31,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:12:31,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:12:31,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:12:31,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:31" (1/1) ... [2024-11-22 10:12:31,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:31" (1/1) ... [2024-11-22 10:12:31,833 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2024-11-22 10:12:31,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:12:31,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:12:31,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:12:31,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:12:31,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:31" (1/1) ... [2024-11-22 10:12:31,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:31" (1/1) ... [2024-11-22 10:12:31,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:31" (1/1) ... [2024-11-22 10:12:31,864 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-22 10:12:31,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:31" (1/1) ... [2024-11-22 10:12:31,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:31" (1/1) ... [2024-11-22 10:12:31,869 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:31" (1/1) ... [2024-11-22 10:12:31,876 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:31" (1/1) ... [2024-11-22 10:12:31,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:31" (1/1) ... [2024-11-22 10:12:31,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:31" (1/1) ... [2024-11-22 10:12:31,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:12:31,883 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:12:31,883 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:12:31,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:12:31,884 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:31" (1/1) ... [2024-11-22 10:12:31,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:12:31,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:12:31,920 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-22 10:12:31,926 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-22 10:12:31,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:12:31,975 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:12:31,976 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:12:31,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:12:31,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:12:31,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:12:32,054 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:12:32,058 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:12:32,372 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-22 10:12:32,372 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:12:32,386 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:12:32,386 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:12:32,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:12:32 BoogieIcfgContainer [2024-11-22 10:12:32,387 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:12:32,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:12:32,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:12:32,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:12:32,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:12:31" (1/3) ... [2024-11-22 10:12:32,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33948df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:12:32, skipping insertion in model container [2024-11-22 10:12:32,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:31" (2/3) ... [2024-11-22 10:12:32,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33948df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:12:32, skipping insertion in model container [2024-11-22 10:12:32,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:12:32" (3/3) ... [2024-11-22 10:12:32,402 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-88.i [2024-11-22 10:12:32,419 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:12:32,419 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:12:32,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:12:32,478 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;@723b3cfa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:12:32,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:12:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 10:12:32,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-22 10:12:32,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:12:32,495 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:12:32,496 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:12:32,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:12:32,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1173194148, now seen corresponding path program 1 times [2024-11-22 10:12:32,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:12:32,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633351799] [2024-11-22 10:12:32,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:12:32,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:12:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:12:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-22 10:12:32,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:12:32,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633351799] [2024-11-22 10:12:32,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633351799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:12:32,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306052234] [2024-11-22 10:12:32,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:12:32,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:12:32,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:12:32,825 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-22 10:12:32,828 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-22 10:12:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:12:32,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:12:32,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:12:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-22 10:12:33,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:12:33,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306052234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:12:33,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:12:33,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:12:33,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571773728] [2024-11-22 10:12:33,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:12:33,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:12:33,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:12:33,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:12:33,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:12:33,105 INFO L87 Difference]: Start difference. First operand has 59 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-22 10:12:33,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:12:33,160 INFO L93 Difference]: Finished difference Result 111 states and 188 transitions. [2024-11-22 10:12:33,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:12:33,162 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2024-11-22 10:12:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:12:33,169 INFO L225 Difference]: With dead ends: 111 [2024-11-22 10:12:33,170 INFO L226 Difference]: Without dead ends: 55 [2024-11-22 10:12:33,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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-22 10:12:33,179 INFO L432 NwaCegarLoop]: 81 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, 81 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-22 10:12:33,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:12:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-22 10:12:33,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-22 10:12:33,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 10:12:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2024-11-22 10:12:33,230 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 116 [2024-11-22 10:12:33,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:12:33,230 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2024-11-22 10:12:33,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-22 10:12:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2024-11-22 10:12:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-22 10:12:33,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:12:33,234 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:12:33,247 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-22 10:12:33,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 10:12:33,437 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:12:33,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:12:33,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1962344732, now seen corresponding path program 1 times [2024-11-22 10:12:33,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:12:33,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306479869] [2024-11-22 10:12:33,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:12:33,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:12:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:12:35,492 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-22 10:12:35,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:12:35,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306479869] [2024-11-22 10:12:35,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306479869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:12:35,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:12:35,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 10:12:35,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721538706] [2024-11-22 10:12:35,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:12:35,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 10:12:35,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:12:35,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 10:12:35,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 10:12:35,498 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-22 10:12:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:12:35,930 INFO L93 Difference]: Finished difference Result 136 states and 194 transitions. [2024-11-22 10:12:35,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 10:12:35,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 116 [2024-11-22 10:12:35,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:12:35,934 INFO L225 Difference]: With dead ends: 136 [2024-11-22 10:12:35,934 INFO L226 Difference]: Without dead ends: 84 [2024-11-22 10:12:35,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-22 10:12:35,936 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 134 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 10:12:35,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 165 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 10:12:35,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-22 10:12:35,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2024-11-22 10:12:35,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 10:12:35,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2024-11-22 10:12:35,959 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 116 [2024-11-22 10:12:35,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:12:35,959 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2024-11-22 10:12:35,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-22 10:12:35,960 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2024-11-22 10:12:35,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-22 10:12:35,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:12:35,963 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:12:35,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:12:35,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:12:35,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:12:35,964 INFO L85 PathProgramCache]: Analyzing trace with hash -557615202, now seen corresponding path program 1 times [2024-11-22 10:12:35,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:12:35,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556054997] [2024-11-22 10:12:35,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:12:35,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:12:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:12:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-22 10:12:36,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:12:36,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556054997] [2024-11-22 10:12:36,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556054997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:12:36,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:12:36,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 10:12:36,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132039054] [2024-11-22 10:12:36,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:12:36,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 10:12:36,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:12:36,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 10:12:36,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 10:12:36,421 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-22 10:12:36,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:12:36,625 INFO L93 Difference]: Finished difference Result 181 states and 259 transitions. [2024-11-22 10:12:36,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 10:12:36,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-22 10:12:36,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:12:36,627 INFO L225 Difference]: With dead ends: 181 [2024-11-22 10:12:36,627 INFO L226 Difference]: Without dead ends: 122 [2024-11-22 10:12:36,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 10:12:36,632 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 57 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:12:36,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 208 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:12:36,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-22 10:12:36,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2024-11-22 10:12:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 72 states have (on average 1.25) internal successors, (90), 72 states have internal predecessors, (90), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-22 10:12:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2024-11-22 10:12:36,676 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 116 [2024-11-22 10:12:36,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:12:36,677 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2024-11-22 10:12:36,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-22 10:12:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2024-11-22 10:12:36,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-22 10:12:36,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:12:36,681 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:12:36,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 10:12:36,682 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:12:36,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:12:36,683 INFO L85 PathProgramCache]: Analyzing trace with hash 917685196, now seen corresponding path program 1 times [2024-11-22 10:12:36,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:12:36,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889660981] [2024-11-22 10:12:36,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:12:36,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:12:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:12:36,885 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-22 10:12:36,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:12:36,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889660981] [2024-11-22 10:12:36,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889660981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:12:36,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:12:36,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 10:12:36,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303520932] [2024-11-22 10:12:36,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:12:36,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 10:12:36,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:12:36,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 10:12:36,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 10:12:36,888 INFO L87 Difference]: Start difference. First operand 113 states and 162 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-22 10:12:37,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:12:37,039 INFO L93 Difference]: Finished difference Result 192 states and 274 transitions. [2024-11-22 10:12:37,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 10:12:37,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-22 10:12:37,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:12:37,041 INFO L225 Difference]: With dead ends: 192 [2024-11-22 10:12:37,041 INFO L226 Difference]: Without dead ends: 122 [2024-11-22 10:12:37,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 10:12:37,043 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 54 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:12:37,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 212 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:12:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-22 10:12:37,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2024-11-22 10:12:37,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 73 states have internal predecessors, (90), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-22 10:12:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-22 10:12:37,072 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 118 [2024-11-22 10:12:37,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:12:37,073 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-22 10:12:37,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-22 10:12:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-22 10:12:37,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-22 10:12:37,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:12:37,080 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:12:37,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 10:12:37,080 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:12:37,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:12:37,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1657814146, now seen corresponding path program 1 times [2024-11-22 10:12:37,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:12:37,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83899033] [2024-11-22 10:12:37,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:12:37,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:12:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:12:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-22 10:12:37,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:12:37,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83899033] [2024-11-22 10:12:37,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83899033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:12:37,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:12:37,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 10:12:37,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163881441] [2024-11-22 10:12:37,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:12:37,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 10:12:37,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:12:37,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 10:12:37,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 10:12:37,393 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-22 10:12:37,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:12:37,645 INFO L93 Difference]: Finished difference Result 211 states and 289 transitions. [2024-11-22 10:12:37,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 10:12:37,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-22 10:12:37,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:12:37,648 INFO L225 Difference]: With dead ends: 211 [2024-11-22 10:12:37,648 INFO L226 Difference]: Without dead ends: 146 [2024-11-22 10:12:37,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-22 10:12:37,653 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 145 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:12:37,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 332 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:12:37,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-22 10:12:37,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 115. [2024-11-22 10:12:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 74 states have internal predecessors, (91), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-22 10:12:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-11-22 10:12:37,724 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 120 [2024-11-22 10:12:37,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:12:37,725 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-11-22 10:12:37,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-22 10:12:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-11-22 10:12:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-22 10:12:37,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:12:37,727 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:12:37,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 10:12:37,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:12:37,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:12:37,730 INFO L85 PathProgramCache]: Analyzing trace with hash -2079707078, now seen corresponding path program 1 times [2024-11-22 10:12:37,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:12:37,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036899673] [2024-11-22 10:12:37,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:12:37,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:12:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:12:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-22 10:12:42,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:12:42,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036899673] [2024-11-22 10:12:42,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036899673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:12:42,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:12:42,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 10:12:42,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304635899] [2024-11-22 10:12:42,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:12:42,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 10:12:42,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:12:42,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 10:12:42,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:12:42,377 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-22 10:12:42,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:12:42,894 INFO L93 Difference]: Finished difference Result 115 states and 163 transitions. [2024-11-22 10:12:42,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 10:12:42,895 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-22 10:12:42,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:12:42,896 INFO L225 Difference]: With dead ends: 115 [2024-11-22 10:12:42,896 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 10:12:42,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-22 10:12:42,897 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 20 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:12:42,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 452 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:12:42,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 10:12:42,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 10:12:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 10:12:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 10:12:42,900 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2024-11-22 10:12:42,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:12:42,900 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 10:12:42,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-22 10:12:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 10:12:42,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 10:12:42,904 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 10:12:42,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 10:12:42,908 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-22 10:12:42,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-22 10:12:44,550 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 10:12:44,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:12:44 BoogieIcfgContainer [2024-11-22 10:12:44,594 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 10:12:44,595 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 10:12:44,595 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 10:12:44,595 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 10:12:44,596 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:12:32" (3/4) ... [2024-11-22 10:12:44,598 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 10:12:44,602 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-22 10:12:44,609 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-22 10:12:44,609 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-22 10:12:44,610 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-22 10:12:44,610 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 10:12:44,720 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 10:12:44,720 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 10:12:44,721 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 10:12:44,721 INFO L158 Benchmark]: Toolchain (without parser) took 13243.48ms. Allocated memory was 184.5MB in the beginning and 486.5MB in the end (delta: 302.0MB). Free memory was 130.1MB in the beginning and 299.7MB in the end (delta: -169.5MB). Peak memory consumption was 133.6MB. Max. memory is 16.1GB. [2024-11-22 10:12:44,721 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 184.5MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:12:44,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.97ms. Allocated memory is still 184.5MB. Free memory was 130.1MB in the beginning and 115.8MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 10:12:44,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.07ms. Allocated memory is still 184.5MB. Free memory was 115.5MB in the beginning and 113.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:12:44,722 INFO L158 Benchmark]: Boogie Preprocessor took 43.71ms. Allocated memory is still 184.5MB. Free memory was 113.4MB in the beginning and 111.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:12:44,722 INFO L158 Benchmark]: RCFGBuilder took 504.16ms. Allocated memory is still 184.5MB. Free memory was 111.0MB in the beginning and 92.8MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-22 10:12:44,723 INFO L158 Benchmark]: TraceAbstraction took 12205.11ms. Allocated memory was 184.5MB in the beginning and 486.5MB in the end (delta: 302.0MB). Free memory was 92.1MB in the beginning and 305.9MB in the end (delta: -213.8MB). Peak memory consumption was 225.9MB. Max. memory is 16.1GB. [2024-11-22 10:12:44,723 INFO L158 Benchmark]: Witness Printer took 125.68ms. Allocated memory is still 486.5MB. Free memory was 305.9MB in the beginning and 299.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 10:12:44,724 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.20ms. Allocated memory is still 184.5MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.97ms. Allocated memory is still 184.5MB. Free memory was 130.1MB in the beginning and 115.8MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.07ms. Allocated memory is still 184.5MB. Free memory was 115.5MB in the beginning and 113.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.71ms. Allocated memory is still 184.5MB. Free memory was 113.4MB in the beginning and 111.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 504.16ms. Allocated memory is still 184.5MB. Free memory was 111.0MB in the beginning and 92.8MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12205.11ms. Allocated memory was 184.5MB in the beginning and 486.5MB in the end (delta: 302.0MB). Free memory was 92.1MB in the beginning and 305.9MB in the end (delta: -213.8MB). Peak memory consumption was 225.9MB. Max. memory is 16.1GB. * Witness Printer took 125.68ms. Allocated memory is still 486.5MB. Free memory was 305.9MB in the beginning and 299.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 6, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 410 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 410 mSDsluCounter, 1450 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 983 mSDsCounter, 247 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 425 IncrementalHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 247 mSolverCounterUnsat, 467 mSDtfsCounter, 425 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=5, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 70 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 822 NumberOfCodeBlocks, 822 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 815 ConstructedInterpolants, 0 QuantifiedInterpolants, 3660 SizeOfPredicates, 0 NumberOfNonLiveVariables, 287 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 4250/4284 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((16 + var_1_15) == 0) && ((((last_1_var_1_15 >= 0) ? (last_1_var_1_15 / 4294967296) : ((last_1_var_1_15 / 4294967296) - 1)) + 1) <= 0)) && (last_1_var_1_18 == 0)) && (25 == var_1_10)) && (var_1_7 <= 127)) && (last_1_var_1_10 <= (41 + last_1_var_1_15))) && ((var_1_9 == 127) || (var_1_9 < 127))) && (25 <= last_1_var_1_10)) && (var_1_18 == 0)) && (var_1_5 == 0)) && (var_1_1 <= var_1_7)) || ((((((((((((var_1_1 == var_1_7) && (0 == 0)) && (var_1_7 <= 127)) && ((((var_1_8 + 1) <= var_1_9) && (var_1_9 == var_1_7)) || (var_1_10 == ((((unsigned long long) 4294967295 * var_1_13) + var_1_11) % 4294967296)))) && ((((var_1_9 < var_1_7) || (((((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256)) == var_1_8) || (127 < ((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256)))) && ((((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256)) == (256 + var_1_8)) || (((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256)) < 128)))) && ((((127 < ((var_1_7 >= 0) ? (var_1_7 % 256) : ((var_1_7 % 256) + 256))) || (((var_1_7 >= 0) ? (var_1_7 % 256) : ((var_1_7 % 256) + 256)) == var_1_8)) && ((((var_1_7 >= 0) ? (var_1_7 % 256) : ((var_1_7 % 256) + 256)) == (256 + var_1_8)) || (((var_1_7 >= 0) ? (var_1_7 % 256) : ((var_1_7 % 256) + 256)) < 128))) || (var_1_7 < (var_1_9 + 1)))) || (var_1_5 == 0))) && (var_1_19 == var_1_18)) && ((((var_1_9 != var_1_7) || ((((var_1_11 + ((unsigned long long) 4294967295 * var_1_12)) + 1) % 4294967296) == var_1_10)) || (var_1_12 < ((long long) var_1_13 + 1))) || (var_1_1 < (var_1_8 + 1)))) && ((((var_1_13 < var_1_12) || (var_1_9 != var_1_7)) || (var_1_1 < (var_1_8 + 1))) || (var_1_10 == (((((unsigned long long) 4294967295 * var_1_13) + var_1_11) + 1) % 4294967296)))) && ((var_1_9 == 127) || (var_1_9 < 127))) && (((((var_1_8 + 1) <= 0) && (((long long) var_1_8 + var_1_14) == 0)) || ((0 <= var_1_8) && (var_1_8 == var_1_14))) || (((var_1_8 >= 0) ? (var_1_8 % 4294967296) : ((var_1_8 % 4294967296) + 4294967296)) < var_1_12))) && (2 == var_1_15)) && (var_1_17 == var_1_16))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((var_1_7 <= 127) && ((var_1_9 == 127) || (var_1_9 < 127))) Ensures: (((var_1_7 <= 127) && ((var_1_9 == 127) || (var_1_9 < 127))) && ((((((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (var_1_19 == \old(var_1_19))) && (last_1_var_1_10 == \old(last_1_var_1_10))) && (last_1_var_1_15 == \old(last_1_var_1_15))) && (last_1_var_1_18 == \old(last_1_var_1_18)))) RESULT: Ultimate proved your program to be correct! [2024-11-22 10:12:44,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE