./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --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/verifythis/elimination_max_rec_onepoint.c -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 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:27:26,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:27:26,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:27:26,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:27:26,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:27:26,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:27:26,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:27:26,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:27:26,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:27:26,363 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:27:26,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:27:26,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:27:26,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:27:26,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:27:26,367 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:27:26,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:27:26,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:27:26,368 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:27:26,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:27:26,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:27:26,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:27:26,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:27:26,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:27:26,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:27:26,370 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:27:26,370 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:27:26,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:27:26,370 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:27:26,371 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:27:26,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:27:26,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:27:26,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:27:26,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:27:26,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:27:26,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:27:26,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:27:26,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:27:26,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:27:26,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:27:26,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:27:26,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:27:26,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:27:26,375 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2024-11-08 15:27:26,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:27:26,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:27:26,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:27:26,669 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:27:26,669 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:27:26,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-11-08 15:27:28,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:27:28,309 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:27:28,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-11-08 15:27:28,317 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/def431d0b/e9feab23aada4f1393626722b23e63d7/FLAGc58642024 [2024-11-08 15:27:28,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/def431d0b/e9feab23aada4f1393626722b23e63d7 [2024-11-08 15:27:28,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:27:28,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:27:28,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:27:28,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:27:28,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:27:28,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:27:28" (1/1) ... [2024-11-08 15:27:28,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@493ee932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:28, skipping insertion in model container [2024-11-08 15:27:28,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:27:28" (1/1) ... [2024-11-08 15:27:28,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:27:28,528 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/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-11-08 15:27:28,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:27:28,573 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:27:28,584 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/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-11-08 15:27:28,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:27:28,614 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:27:28,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:28 WrapperNode [2024-11-08 15:27:28,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:27:28,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:27:28,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:27:28,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:27:28,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:28" (1/1) ... [2024-11-08 15:27:28,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:28" (1/1) ... [2024-11-08 15:27:28,644 INFO L138 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2024-11-08 15:27:28,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:27:28,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:27:28,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:27:28,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:27:28,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:28" (1/1) ... [2024-11-08 15:27:28,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:28" (1/1) ... [2024-11-08 15:27:28,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:28" (1/1) ... [2024-11-08 15:27:28,672 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-08 15:27:28,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:28" (1/1) ... [2024-11-08 15:27:28,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:28" (1/1) ... [2024-11-08 15:27:28,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:28" (1/1) ... [2024-11-08 15:27:28,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:28" (1/1) ... [2024-11-08 15:27:28,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:28" (1/1) ... [2024-11-08 15:27:28,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:28" (1/1) ... [2024-11-08 15:27:28,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:27:28,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:27:28,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:27:28,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:27:28,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:28" (1/1) ... [2024-11-08 15:27:28,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:27:28,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:27:28,739 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 15:27:28,742 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 15:27:28,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:27:28,796 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 15:27:28,796 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 15:27:28,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:27:28,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 15:27:28,797 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-11-08 15:27:28,797 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-11-08 15:27:28,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 15:27:28,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:27:28,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:27:28,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 15:27:28,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 15:27:28,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 15:27:28,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 15:27:28,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 15:27:28,893 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:27:28,896 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:27:29,098 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-08 15:27:29,098 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:27:29,116 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:27:29,116 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:27:29,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:27:29 BoogieIcfgContainer [2024-11-08 15:27:29,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:27:29,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:27:29,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:27:29,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:27:29,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:27:28" (1/3) ... [2024-11-08 15:27:29,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35458872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:27:29, skipping insertion in model container [2024-11-08 15:27:29,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:28" (2/3) ... [2024-11-08 15:27:29,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35458872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:27:29, skipping insertion in model container [2024-11-08 15:27:29,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:27:29" (3/3) ... [2024-11-08 15:27:29,128 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-11-08 15:27:29,146 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:27:29,146 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:27:29,214 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:27:29,221 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;@5fcf627b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:27:29,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:27:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 15:27:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 15:27:29,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:27:29,237 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:27:29,237 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:27:29,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:27:29,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2131135201, now seen corresponding path program 1 times [2024-11-08 15:27:29,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:27:29,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826855613] [2024-11-08 15:27:29,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:27:29,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:27:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:29,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:27:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:29,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:27:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:27:29,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:27:29,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826855613] [2024-11-08 15:27:29,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826855613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:27:29,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:27:29,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 15:27:29,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066738205] [2024-11-08 15:27:29,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:27:29,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:27:29,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:27:29,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:27:29,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:27:29,518 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:27:29,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:27:29,540 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2024-11-08 15:27:29,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:27:29,542 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-08 15:27:29,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:27:29,549 INFO L225 Difference]: With dead ends: 69 [2024-11-08 15:27:29,549 INFO L226 Difference]: Without dead ends: 32 [2024-11-08 15:27:29,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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 15:27:29,556 INFO L432 NwaCegarLoop]: 42 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, 42 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 15:27:29,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:27:29,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-08 15:27:29,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-08 15:27:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 15:27:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-08 15:27:29,605 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 22 [2024-11-08 15:27:29,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:27:29,606 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-08 15:27:29,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:27:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-08 15:27:29,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 15:27:29,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:27:29,608 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:27:29,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:27:29,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:27:29,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:27:29,609 INFO L85 PathProgramCache]: Analyzing trace with hash 427852827, now seen corresponding path program 1 times [2024-11-08 15:27:29,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:27:29,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435321019] [2024-11-08 15:27:29,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:27:29,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:27:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:30,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:27:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:30,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:27:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:30,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:27:30,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:27:30,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435321019] [2024-11-08 15:27:30,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435321019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:27:30,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:27:30,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:27:30,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161240411] [2024-11-08 15:27:30,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:27:30,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:27:30,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:27:30,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:27:30,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:27:30,052 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:27:30,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:27:30,228 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2024-11-08 15:27:30,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:27:30,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-08 15:27:30,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:27:30,233 INFO L225 Difference]: With dead ends: 56 [2024-11-08 15:27:30,233 INFO L226 Difference]: Without dead ends: 54 [2024-11-08 15:27:30,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:27:30,238 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:27:30,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 156 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:27:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-08 15:27:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2024-11-08 15:27:30,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 15:27:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2024-11-08 15:27:30,256 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 22 [2024-11-08 15:27:30,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:27:30,256 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2024-11-08 15:27:30,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:27:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2024-11-08 15:27:30,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 15:27:30,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:27:30,258 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:27:30,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:27:30,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:27:30,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:27:30,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1966681632, now seen corresponding path program 1 times [2024-11-08 15:27:30,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:27:30,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318985873] [2024-11-08 15:27:30,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:27:30,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:27:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:30,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:27:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:30,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:27:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:30,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:27:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:27:30,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:27:30,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318985873] [2024-11-08 15:27:30,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318985873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:27:30,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:27:30,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:27:30,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184976455] [2024-11-08 15:27:30,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:27:30,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:27:30,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:27:30,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:27:30,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:27:30,585 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:27:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:27:30,662 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-11-08 15:27:30,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:27:30,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-11-08 15:27:30,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:27:30,666 INFO L225 Difference]: With dead ends: 55 [2024-11-08 15:27:30,666 INFO L226 Difference]: Without dead ends: 47 [2024-11-08 15:27:30,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:27:30,667 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:27:30,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 199 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:27:30,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-08 15:27:30,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-08 15:27:30,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 15:27:30,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2024-11-08 15:27:30,686 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 25 [2024-11-08 15:27:30,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:27:30,686 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2024-11-08 15:27:30,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:27:30,687 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2024-11-08 15:27:30,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 15:27:30,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:27:30,688 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:27:30,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:27:30,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:27:30,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:27:30,689 INFO L85 PathProgramCache]: Analyzing trace with hash 275746502, now seen corresponding path program 1 times [2024-11-08 15:27:30,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:27:30,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129867988] [2024-11-08 15:27:30,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:27:30,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:27:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:30,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:27:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:30,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:27:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:30,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:27:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:30,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:27:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 15:27:30,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:27:30,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129867988] [2024-11-08 15:27:30,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129867988] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:27:30,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40553205] [2024-11-08 15:27:30,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:27:30,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:27:30,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:27:30,984 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 15:27:30,986 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 15:27:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:31,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 15:27:31,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:27:31,290 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 15:27:31,290 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:27:31,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40553205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:27:31,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:27:31,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2024-11-08 15:27:31,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325502857] [2024-11-08 15:27:31,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:27:31,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:27:31,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:27:31,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:27:31,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-08 15:27:31,296 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:27:31,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:27:31,474 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2024-11-08 15:27:31,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:27:31,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2024-11-08 15:27:31,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:27:31,476 INFO L225 Difference]: With dead ends: 62 [2024-11-08 15:27:31,476 INFO L226 Difference]: Without dead ends: 60 [2024-11-08 15:27:31,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:27:31,478 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 30 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:27:31,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 176 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:27:31,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-08 15:27:31,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 34. [2024-11-08 15:27:31,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 15:27:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-11-08 15:27:31,487 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 37 [2024-11-08 15:27:31,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:27:31,487 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-11-08 15:27:31,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:27:31,488 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-11-08 15:27:31,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 15:27:31,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:27:31,489 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 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 15:27:31,508 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 15:27:31,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:27:31,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:27:31,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:27:31,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2013704482, now seen corresponding path program 1 times [2024-11-08 15:27:31,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:27:31,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921714632] [2024-11-08 15:27:31,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:27:31,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:27:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:31,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:27:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:31,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:27:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:31,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:27:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:31,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:27:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:31,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:27:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 15:27:31,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:27:31,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921714632] [2024-11-08 15:27:31,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921714632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:27:31,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000693223] [2024-11-08 15:27:31,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:27:31,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:27:31,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:27:31,899 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 15:27:31,901 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 15:27:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:31,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 15:27:31,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:27:32,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-11-08 15:27:32,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-11-08 15:27:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:27:32,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:27:40,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000693223] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:27:40,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 15:27:40,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 20 [2024-11-08 15:27:40,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803111610] [2024-11-08 15:27:40,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 15:27:40,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 15:27:40,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:27:40,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 15:27:40,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-11-08 15:27:40,613 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 20 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-08 15:27:40,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:27:40,935 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2024-11-08 15:27:40,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 15:27:40,936 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 40 [2024-11-08 15:27:40,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:27:40,937 INFO L225 Difference]: With dead ends: 40 [2024-11-08 15:27:40,937 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 15:27:40,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2024-11-08 15:27:40,939 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:27:40,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 238 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:27:40,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 15:27:40,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 15:27:40,940 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-08 15:27:40,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 15:27:40,940 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2024-11-08 15:27:40,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:27:40,941 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 15:27:40,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-08 15:27:40,941 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 15:27:40,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 15:27:40,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:27:40,968 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 15:27:41,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:27:41,158 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 15:27:41,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 15:27:41,743 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:27:41,773 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:166) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateProcedureContract(DefaultTranslator.java:377) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:349) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:338) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateProcedureContract(BacktranslationService.java:94) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-08 15:27:41,777 INFO L158 Benchmark]: Toolchain (without parser) took 13444.79ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 106.5MB in the beginning and 144.0MB in the end (delta: -37.4MB). Peak memory consumption was 113.5MB. Max. memory is 16.1GB. [2024-11-08 15:27:41,778 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 163.6MB. Free memory was 124.4MB in the beginning and 124.2MB in the end (delta: 148.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:27:41,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.11ms. Allocated memory is still 163.6MB. Free memory was 106.5MB in the beginning and 93.2MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 15:27:41,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.87ms. Allocated memory is still 163.6MB. Free memory was 93.2MB in the beginning and 91.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:27:41,778 INFO L158 Benchmark]: Boogie Preprocessor took 39.46ms. Allocated memory is still 163.6MB. Free memory was 91.9MB in the beginning and 89.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:27:41,779 INFO L158 Benchmark]: RCFGBuilder took 431.35ms. Allocated memory is still 163.6MB. Free memory was 89.8MB in the beginning and 76.0MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 15:27:41,779 INFO L158 Benchmark]: TraceAbstraction took 12657.41ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 75.1MB in the beginning and 144.0MB in the end (delta: -68.8MB). Peak memory consumption was 82.0MB. Max. memory is 16.1GB. [2024-11-08 15:27:41,781 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.28ms. Allocated memory is still 163.6MB. Free memory was 124.4MB in the beginning and 124.2MB in the end (delta: 148.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.11ms. Allocated memory is still 163.6MB. Free memory was 106.5MB in the beginning and 93.2MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.87ms. Allocated memory is still 163.6MB. Free memory was 93.2MB in the beginning and 91.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.46ms. Allocated memory is still 163.6MB. Free memory was 91.9MB in the beginning and 89.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 431.35ms. Allocated memory is still 163.6MB. Free memory was 89.8MB in the beginning and 76.0MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12657.41ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 75.1MB in the beginning and 144.0MB in the end (delta: -68.8MB). Peak memory consumption was 82.0MB. 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: 11]: 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 4 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 811 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 640 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 475 IncrementalHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 171 mSDtfsCounter, 475 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=2, InterpolantAutomatonStates: 40, 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, 5 MinimizatonAttempts, 31 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 223 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 216 ConstructedInterpolants, 13 QuantifiedInterpolants, 680 SizeOfPredicates, 16 NumberOfNonLiveVariables, 343 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 63/78 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 - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-08 15:27:41,816 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/verifythis/elimination_max_rec_onepoint.c -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 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:27:44,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:27:44,240 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 15:27:44,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:27:44,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:27:44,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:27:44,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:27:44,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:27:44,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:27:44,286 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:27:44,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:27:44,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:27:44,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:27:44,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:27:44,288 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:27:44,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:27:44,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:27:44,294 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:27:44,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:27:44,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:27:44,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:27:44,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:27:44,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:27:44,297 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 15:27:44,298 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 15:27:44,298 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:27:44,298 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 15:27:44,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:27:44,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:27:44,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:27:44,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:27:44,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:27:44,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:27:44,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:27:44,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:27:44,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:27:44,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:27:44,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:27:44,302 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 15:27:44,303 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 15:27:44,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:27:44,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:27:44,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:27:44,305 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:27:44,305 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2024-11-08 15:27:44,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:27:44,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:27:44,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:27:44,692 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:27:44,692 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:27:44,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-11-08 15:27:46,293 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:27:46,506 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:27:46,508 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-11-08 15:27:46,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e0191674/ec0bd650b6354e64b1cc06d484095899/FLAG2eb276494 [2024-11-08 15:27:46,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e0191674/ec0bd650b6354e64b1cc06d484095899 [2024-11-08 15:27:46,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:27:46,545 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:27:46,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:27:46,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:27:46,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:27:46,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:27:46" (1/1) ... [2024-11-08 15:27:46,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40ba4143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:46, skipping insertion in model container [2024-11-08 15:27:46,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:27:46" (1/1) ... [2024-11-08 15:27:46,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:27:46,784 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/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-11-08 15:27:46,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:27:46,856 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:27:46,878 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/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-11-08 15:27:46,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:27:46,911 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:27:46,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:46 WrapperNode [2024-11-08 15:27:46,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:27:46,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:27:46,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:27:46,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:27:46,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:46" (1/1) ... [2024-11-08 15:27:46,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:46" (1/1) ... [2024-11-08 15:27:46,953 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 35 [2024-11-08 15:27:46,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:27:46,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:27:46,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:27:46,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:27:46,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:46" (1/1) ... [2024-11-08 15:27:46,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:46" (1/1) ... [2024-11-08 15:27:46,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:46" (1/1) ... [2024-11-08 15:27:46,996 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-08 15:27:46,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:46" (1/1) ... [2024-11-08 15:27:46,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:46" (1/1) ... [2024-11-08 15:27:47,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:46" (1/1) ... [2024-11-08 15:27:47,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:46" (1/1) ... [2024-11-08 15:27:47,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:46" (1/1) ... [2024-11-08 15:27:47,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:46" (1/1) ... [2024-11-08 15:27:47,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:27:47,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:27:47,026 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:27:47,027 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:27:47,028 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:46" (1/1) ... [2024-11-08 15:27:47,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:27:47,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:27:47,063 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 15:27:47,068 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 15:27:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:27:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 15:27:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 15:27:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 15:27:47,110 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 15:27:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-11-08 15:27:47,111 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-11-08 15:27:47,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 15:27:47,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 15:27:47,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 15:27:47,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:27:47,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:27:47,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 15:27:47,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 15:27:47,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 15:27:47,236 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:27:47,241 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:27:47,492 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-08 15:27:47,492 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:27:47,509 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:27:47,510 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:27:47,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:27:47 BoogieIcfgContainer [2024-11-08 15:27:47,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:27:47,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:27:47,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:27:47,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:27:47,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:27:46" (1/3) ... [2024-11-08 15:27:47,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c77b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:27:47, skipping insertion in model container [2024-11-08 15:27:47,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:46" (2/3) ... [2024-11-08 15:27:47,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c77b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:27:47, skipping insertion in model container [2024-11-08 15:27:47,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:27:47" (3/3) ... [2024-11-08 15:27:47,523 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-11-08 15:27:47,541 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:27:47,542 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:27:47,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:27:47,620 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;@3ce10d09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:27:47,621 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:27:47,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 15:27:47,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 15:27:47,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:27:47,634 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:27:47,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:27:47,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:27:47,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2131135201, now seen corresponding path program 1 times [2024-11-08 15:27:47,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 15:27:47,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961076518] [2024-11-08 15:27:47,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:27:47,657 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 15:27:47,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 15:27:47,659 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 15:27:47,660 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 15:27:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:47,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 15:27:47,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:27:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 15:27:47,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:27:47,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 15:27:47,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961076518] [2024-11-08 15:27:47,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961076518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:27:47,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:27:47,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 15:27:47,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405662354] [2024-11-08 15:27:47,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:27:47,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:27:47,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 15:27:47,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:27:47,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:27:47,860 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:27:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:27:47,887 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2024-11-08 15:27:47,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:27:47,889 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-08 15:27:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:27:47,896 INFO L225 Difference]: With dead ends: 69 [2024-11-08 15:27:47,897 INFO L226 Difference]: Without dead ends: 32 [2024-11-08 15:27:47,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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 15:27:47,906 INFO L432 NwaCegarLoop]: 42 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, 42 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 15:27:47,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:27:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-08 15:27:47,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-08 15:27:47,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 15:27:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-08 15:27:47,946 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 22 [2024-11-08 15:27:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:27:47,947 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-08 15:27:47,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:27:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-08 15:27:47,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 15:27:47,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:27:47,949 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:27:47,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 15:27:48,150 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 15:27:48,150 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:27:48,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:27:48,151 INFO L85 PathProgramCache]: Analyzing trace with hash 427852827, now seen corresponding path program 1 times [2024-11-08 15:27:48,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 15:27:48,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117348030] [2024-11-08 15:27:48,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:27:48,152 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 15:27:48,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 15:27:48,155 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 15:27:48,158 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 15:27:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:48,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 15:27:48,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:27:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:27:48,716 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:27:48,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 15:27:48,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117348030] [2024-11-08 15:27:48,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117348030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:27:48,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:27:48,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 15:27:48,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555555247] [2024-11-08 15:27:48,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:27:48,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 15:27:48,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 15:27:48,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 15:27:48,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:27:48,722 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:27:49,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:27:49,115 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-11-08 15:27:49,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 15:27:49,116 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-08 15:27:49,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:27:49,117 INFO L225 Difference]: With dead ends: 50 [2024-11-08 15:27:49,117 INFO L226 Difference]: Without dead ends: 48 [2024-11-08 15:27:49,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-08 15:27:49,119 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:27:49,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 209 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:27:49,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-08 15:27:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-08 15:27:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 15:27:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-11-08 15:27:49,139 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 22 [2024-11-08 15:27:49,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:27:49,140 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-11-08 15:27:49,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:27:49,140 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-11-08 15:27:49,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 15:27:49,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:27:49,141 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:27:49,146 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 15:27:49,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 15:27:49,343 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:27:49,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:27:49,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1966681632, now seen corresponding path program 1 times [2024-11-08 15:27:49,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 15:27:49,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246615886] [2024-11-08 15:27:49,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:27:49,345 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 15:27:49,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 15:27:49,348 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 15:27:49,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 15:27:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:49,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 15:27:49,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:27:49,761 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 15:27:49,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 15:27:49,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2024-11-08 15:27:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:27:49,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:27:49,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 15:27:49,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246615886] [2024-11-08 15:27:49,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246615886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:27:49,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:27:49,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 15:27:49,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258840393] [2024-11-08 15:27:49,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:27:49,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 15:27:49,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 15:27:49,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 15:27:49,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-08 15:27:49,856 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 14 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:27:50,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:27:50,181 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2024-11-08 15:27:50,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:27:50,181 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2024-11-08 15:27:50,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:27:50,184 INFO L225 Difference]: With dead ends: 60 [2024-11-08 15:27:50,184 INFO L226 Difference]: Without dead ends: 50 [2024-11-08 15:27:50,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:27:50,186 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:27:50,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 219 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:27:50,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-08 15:27:50,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2024-11-08 15:27:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 15:27:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2024-11-08 15:27:50,198 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 25 [2024-11-08 15:27:50,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:27:50,199 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2024-11-08 15:27:50,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:27:50,199 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2024-11-08 15:27:50,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 15:27:50,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:27:50,200 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:27:50,207 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 (4)] Ended with exit code 0 [2024-11-08 15:27:50,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 15:27:50,403 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:27:50,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:27:50,404 INFO L85 PathProgramCache]: Analyzing trace with hash 275746502, now seen corresponding path program 1 times [2024-11-08 15:27:50,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 15:27:50,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174190977] [2024-11-08 15:27:50,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:27:50,405 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 15:27:50,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 15:27:50,408 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 15:27:50,410 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 15:27:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:50,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 15:27:50,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:27:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 15:27:51,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:27:51,525 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 15:27:51,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 15:27:51,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174190977] [2024-11-08 15:27:51,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174190977] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:27:51,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 15:27:51,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2024-11-08 15:27:51,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944281820] [2024-11-08 15:27:51,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 15:27:51,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 15:27:51,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 15:27:51,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 15:27:51,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-11-08 15:27:51,533 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 8 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-08 15:27:52,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:27:52,953 INFO L93 Difference]: Finished difference Result 102 states and 134 transitions. [2024-11-08 15:27:52,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-08 15:27:52,953 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 8 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 37 [2024-11-08 15:27:52,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:27:52,955 INFO L225 Difference]: With dead ends: 102 [2024-11-08 15:27:52,955 INFO L226 Difference]: Without dead ends: 100 [2024-11-08 15:27:52,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2024-11-08 15:27:52,960 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 69 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 15:27:52,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 326 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 15:27:52,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-08 15:27:52,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2024-11-08 15:27:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 states have internal predecessors, (55), 23 states have call successors, (23), 8 states have call predecessors, (23), 8 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 15:27:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2024-11-08 15:27:52,995 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 37 [2024-11-08 15:27:52,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:27:52,996 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2024-11-08 15:27:52,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 8 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-08 15:27:52,997 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2024-11-08 15:27:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 15:27:52,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:27:52,999 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 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 15:27:53,004 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 15:27:53,200 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 [2024-11-08 15:27:53,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:27:53,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:27:53,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2013704482, now seen corresponding path program 1 times [2024-11-08 15:27:53,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 15:27:53,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615299535] [2024-11-08 15:27:53,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:27:53,201 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 15:27:53,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 15:27:53,202 INFO L229 MonitoredProcess]: Starting monitored process 6 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 15:27:53,204 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 (6)] Waiting until timeout for monitored process [2024-11-08 15:27:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:53,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 15:27:53,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:27:54,318 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 15:27:54,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 15:27:54,420 INFO L349 Elim1Store]: treesize reduction 58, result has 44.2 percent of original size [2024-11-08 15:27:54,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 43 treesize of output 58 [2024-11-08 15:27:54,653 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 15:27:54,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:28:11,973 INFO L349 Elim1Store]: treesize reduction 5, result has 92.3 percent of original size [2024-11-08 15:28:11,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 67 [2024-11-08 15:28:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 15:28:13,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 15:28:13,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615299535] [2024-11-08 15:28:13,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615299535] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:28:13,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 15:28:13,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 32 [2024-11-08 15:28:13,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372210032] [2024-11-08 15:28:13,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 15:28:13,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 15:28:13,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 15:28:13,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 15:28:13,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=890, Unknown=4, NotChecked=0, Total=992 [2024-11-08 15:28:13,493 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand has 32 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 24 states have internal predecessors, (40), 9 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-08 15:28:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:28:19,035 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2024-11-08 15:28:19,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 15:28:19,037 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 24 states have internal predecessors, (40), 9 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) Word has length 40 [2024-11-08 15:28:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:28:19,039 INFO L225 Difference]: With dead ends: 105 [2024-11-08 15:28:19,039 INFO L226 Difference]: Without dead ends: 103 [2024-11-08 15:28:19,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=256, Invalid=2190, Unknown=4, NotChecked=0, Total=2450 [2024-11-08 15:28:19,041 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 53 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:28:19,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 429 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 15:28:19,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-08 15:28:19,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2024-11-08 15:28:19,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 62 states have internal predecessors, (64), 24 states have call successors, (24), 10 states have call predecessors, (24), 12 states have return successors, (28), 20 states have call predecessors, (28), 23 states have call successors, (28) [2024-11-08 15:28:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2024-11-08 15:28:19,063 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 40 [2024-11-08 15:28:19,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:28:19,063 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2024-11-08 15:28:19,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 24 states have internal predecessors, (40), 9 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-08 15:28:19,064 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2024-11-08 15:28:19,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 15:28:19,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:28:19,065 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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 15:28:19,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-08 15:28:19,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 15:28:19,267 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:28:19,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:28:19,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1755819389, now seen corresponding path program 1 times [2024-11-08 15:28:19,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 15:28:19,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078834032] [2024-11-08 15:28:19,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:28:19,268 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 15:28:19,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 15:28:19,269 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 15:28:19,270 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 15:28:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:19,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 15:28:19,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:28:19,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 15:28:19,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2024-11-08 15:28:19,919 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 15:28:19,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:28:20,636 INFO L349 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2024-11-08 15:28:20,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 95 [2024-11-08 15:28:21,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 15:28:21,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078834032] [2024-11-08 15:28:21,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078834032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:28:21,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [810561700] [2024-11-08 15:28:21,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:28:21,600 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 15:28:21,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 15:28:21,602 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 15:28:21,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-08 15:28:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:21,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 15:28:21,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:28:21,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-11-08 15:28:25,923 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-11-08 15:28:26,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-11-08 15:28:26,235 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 4 not checked. [2024-11-08 15:28:26,235 INFO L311 TraceCheckSpWp]: Computing backward predicates...