./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/bAnd5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/array-crafted/bAnd5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d475be4701a825f0568ebf884900dce77e1216a215283bc51d05a41cc9a8ddb5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 15:36:57,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 15:36:57,699 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 15:36:57,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 15:36:57,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 15:36:57,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 15:36:57,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 15:36:57,733 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 15:36:57,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 15:36:57,735 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 15:36:57,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 15:36:57,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 15:36:57,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 15:36:57,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 15:36:57,737 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 15:36:57,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 15:36:57,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 15:36:57,740 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 15:36:57,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 15:36:57,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 15:36:57,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 15:36:57,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 15:36:57,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 15:36:57,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 15:36:57,742 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 15:36:57,742 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 15:36:57,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 15:36:57,742 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 15:36:57,742 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 15:36:57,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 15:36:57,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 15:36:57,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 15:36:57,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 15:36:57,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 15:36:57,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 15:36:57,744 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 15:36:57,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 15:36:57,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 15:36:57,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 15:36:57,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 15:36:57,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 15:36:57,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 15:36:57,745 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 -> d475be4701a825f0568ebf884900dce77e1216a215283bc51d05a41cc9a8ddb5 [2024-11-11 15:36:57,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 15:36:58,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 15:36:58,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 15:36:58,017 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 15:36:58,018 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 15:36:58,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/bAnd5.i [2024-11-11 15:36:59,520 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 15:36:59,778 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 15:36:59,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i [2024-11-11 15:36:59,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7defdbb0a/2bf0f7abedda4f16b312b3051f7cd5da/FLAGbe4a45c84 [2024-11-11 15:37:00,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7defdbb0a/2bf0f7abedda4f16b312b3051f7cd5da [2024-11-11 15:37:00,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 15:37:00,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 15:37:00,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 15:37:00,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 15:37:00,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 15:37:00,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 03:37:00" (1/1) ... [2024-11-11 15:37:00,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d677c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:37:00, skipping insertion in model container [2024-11-11 15:37:00,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 03:37:00" (1/1) ... [2024-11-11 15:37:00,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 15:37:00,308 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/array-crafted/bAnd5.i[1369,1382] [2024-11-11 15:37:00,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 15:37:00,324 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 15:37:00,349 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/array-crafted/bAnd5.i[1369,1382] [2024-11-11 15:37:00,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 15:37:00,368 INFO L204 MainTranslator]: Completed translation [2024-11-11 15:37:00,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:37:00 WrapperNode [2024-11-11 15:37:00,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 15:37:00,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 15:37:00,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 15:37:00,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 15:37:00,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:37:00" (1/1) ... [2024-11-11 15:37:00,386 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:37:00" (1/1) ... [2024-11-11 15:37:00,411 INFO L138 Inliner]: procedures = 16, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 82 [2024-11-11 15:37:00,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 15:37:00,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 15:37:00,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 15:37:00,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 15:37:00,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:37:00" (1/1) ... [2024-11-11 15:37:00,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:37:00" (1/1) ... [2024-11-11 15:37:00,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:37:00" (1/1) ... [2024-11-11 15:37:00,441 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 5 writes are split as follows [0, 0, 5]. [2024-11-11 15:37:00,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:37:00" (1/1) ... [2024-11-11 15:37:00,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:37:00" (1/1) ... [2024-11-11 15:37:00,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:37:00" (1/1) ... [2024-11-11 15:37:00,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:37:00" (1/1) ... [2024-11-11 15:37:00,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:37:00" (1/1) ... [2024-11-11 15:37:00,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:37:00" (1/1) ... [2024-11-11 15:37:00,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 15:37:00,465 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 15:37:00,465 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 15:37:00,465 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 15:37:00,466 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:37:00" (1/1) ... [2024-11-11 15:37:00,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 15:37:00,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:37:00,500 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-11 15:37:00,502 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-11 15:37:00,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 15:37:00,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 15:37:00,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 15:37:00,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 15:37:00,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 15:37:00,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-11 15:37:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-11 15:37:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-11 15:37:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2024-11-11 15:37:00,539 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2024-11-11 15:37:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 15:37:00,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 15:37:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 15:37:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 15:37:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-11 15:37:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 15:37:00,611 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 15:37:00,613 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 15:37:00,844 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-11 15:37:00,844 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 15:37:00,854 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 15:37:00,854 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-11 15:37:00,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:37:00 BoogieIcfgContainer [2024-11-11 15:37:00,855 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 15:37:00,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 15:37:00,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 15:37:00,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 15:37:00,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 03:37:00" (1/3) ... [2024-11-11 15:37:00,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edca8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 03:37:00, skipping insertion in model container [2024-11-11 15:37:00,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:37:00" (2/3) ... [2024-11-11 15:37:00,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edca8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 03:37:00, skipping insertion in model container [2024-11-11 15:37:00,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:37:00" (3/3) ... [2024-11-11 15:37:00,862 INFO L112 eAbstractionObserver]: Analyzing ICFG bAnd5.i [2024-11-11 15:37:00,876 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 15:37:00,876 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 15:37:00,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 15:37:00,931 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;@a285444, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 15:37:00,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 15:37:00,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 15:37:00,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-11 15:37:00,942 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:37:00,943 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:37:00,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:37:00,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:37:00,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1617415168, now seen corresponding path program 1 times [2024-11-11 15:37:00,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:37:00,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527747240] [2024-11-11 15:37:00,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:37:00,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:37:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:01,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 15:37:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:01,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 15:37:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:01,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 15:37:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 15:37:01,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:37:01,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527747240] [2024-11-11 15:37:01,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527747240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:37:01,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:37:01,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 15:37:01,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579547856] [2024-11-11 15:37:01,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:37:01,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 15:37:01,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:37:01,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 15:37:01,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 15:37:01,341 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 15:37:01,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:37:01,397 INFO L93 Difference]: Finished difference Result 63 states and 87 transitions. [2024-11-11 15:37:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 15:37:01,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2024-11-11 15:37:01,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:37:01,405 INFO L225 Difference]: With dead ends: 63 [2024-11-11 15:37:01,405 INFO L226 Difference]: Without dead ends: 30 [2024-11-11 15:37:01,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 15:37:01,411 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:37:01,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:37:01,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-11 15:37:01,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-11-11 15:37:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 15:37:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-11 15:37:01,443 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 30 [2024-11-11 15:37:01,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:37:01,452 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-11 15:37:01,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 15:37:01,452 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-11 15:37:01,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-11 15:37:01,454 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:37:01,454 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:37:01,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 15:37:01,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:37:01,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:37:01,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1295325000, now seen corresponding path program 1 times [2024-11-11 15:37:01,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:37:01,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535082707] [2024-11-11 15:37:01,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:37:01,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:37:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:01,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 15:37:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:01,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 15:37:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:01,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 15:37:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 15:37:01,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:37:01,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535082707] [2024-11-11 15:37:01,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535082707] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:37:01,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712823932] [2024-11-11 15:37:01,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:37:01,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:37:01,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:37:01,652 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-11 15:37:01,658 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-11 15:37:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:01,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 15:37:01,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:37:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 15:37:01,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:37:01,878 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 15:37:01,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712823932] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:37:01,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 15:37:01,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-11-11 15:37:01,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614046281] [2024-11-11 15:37:01,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 15:37:01,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 15:37:01,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:37:01,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 15:37:01,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-11 15:37:01,887 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 15:37:01,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:37:01,958 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2024-11-11 15:37:01,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 15:37:01,958 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 32 [2024-11-11 15:37:01,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:37:01,959 INFO L225 Difference]: With dead ends: 61 [2024-11-11 15:37:01,959 INFO L226 Difference]: Without dead ends: 38 [2024-11-11 15:37:01,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-11 15:37:01,962 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:37:01,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 80 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:37:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-11 15:37:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2024-11-11 15:37:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 15:37:01,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-11 15:37:01,969 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 32 [2024-11-11 15:37:01,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:37:01,970 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-11 15:37:01,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 15:37:01,970 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-11 15:37:01,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 15:37:01,971 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:37:01,971 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:37:01,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 15:37:02,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:37:02,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:37:02,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:37:02,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1588566225, now seen corresponding path program 1 times [2024-11-11 15:37:02,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:37:02,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163880738] [2024-11-11 15:37:02,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:37:02,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:37:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:02,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 15:37:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:02,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 15:37:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:02,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 15:37:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 15:37:02,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:37:02,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163880738] [2024-11-11 15:37:02,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163880738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:37:02,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551230157] [2024-11-11 15:37:02,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:37:02,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:37:02,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:37:02,381 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-11 15:37:02,389 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-11 15:37:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:02,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 15:37:02,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:37:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 15:37:02,536 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:37:02,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551230157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:37:02,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 15:37:02,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-11 15:37:02,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838155765] [2024-11-11 15:37:02,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:37:02,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:37:02,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:37:02,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:37:02,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 15:37:02,540 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 15:37:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:37:02,580 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2024-11-11 15:37:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 15:37:02,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-11 15:37:02,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:37:02,582 INFO L225 Difference]: With dead ends: 51 [2024-11-11 15:37:02,582 INFO L226 Difference]: Without dead ends: 34 [2024-11-11 15:37:02,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 15:37:02,584 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:37:02,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:37:02,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-11 15:37:02,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-11 15:37:02,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 15:37:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-11 15:37:02,594 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 46 [2024-11-11 15:37:02,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:37:02,596 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-11 15:37:02,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 15:37:02,597 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-11-11 15:37:02,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 15:37:02,598 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:37:02,599 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-11-11 15:37:02,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 15:37:02,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-11 15:37:02,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:37:02,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:37:02,801 INFO L85 PathProgramCache]: Analyzing trace with hash 480375887, now seen corresponding path program 1 times [2024-11-11 15:37:02,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:37:02,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057834689] [2024-11-11 15:37:02,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:37:02,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:37:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:03,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 15:37:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:03,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 15:37:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:03,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 15:37:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:03,358 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 15:37:03,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:37:03,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057834689] [2024-11-11 15:37:03,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057834689] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:37:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936736171] [2024-11-11 15:37:03,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:37:03,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:37:03,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:37:03,363 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:37:03,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 15:37:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:03,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-11 15:37:03,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:37:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 15:37:03,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:37:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 15:37:03,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936736171] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:37:03,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 15:37:03,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2024-11-11 15:37:03,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011316778] [2024-11-11 15:37:03,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 15:37:03,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-11 15:37:03,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:37:03,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-11 15:37:03,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-11 15:37:03,810 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 15:37:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:37:03,882 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2024-11-11 15:37:03,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 15:37:03,883 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2024-11-11 15:37:03,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:37:03,885 INFO L225 Difference]: With dead ends: 83 [2024-11-11 15:37:03,885 INFO L226 Difference]: Without dead ends: 58 [2024-11-11 15:37:03,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-11 15:37:03,886 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 10 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:37:03,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 290 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:37:03,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-11 15:37:03,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2024-11-11 15:37:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.175) internal successors, (47), 41 states have internal predecessors, (47), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-11 15:37:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2024-11-11 15:37:03,895 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 48 [2024-11-11 15:37:03,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:37:03,895 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2024-11-11 15:37:03,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 15:37:03,895 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2024-11-11 15:37:03,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-11 15:37:03,896 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:37:03,900 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 15:37:03,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 15:37:04,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:37:04,105 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:37:04,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:37:04,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1030385955, now seen corresponding path program 1 times [2024-11-11 15:37:04,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:37:04,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017084207] [2024-11-11 15:37:04,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:37:04,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:37:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:04,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 15:37:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:04,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 15:37:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:04,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 15:37:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:05,116 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 15:37:05,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:37:05,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017084207] [2024-11-11 15:37:05,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017084207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:37:05,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399818301] [2024-11-11 15:37:05,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:37:05,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:37:05,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:37:05,119 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:37:05,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 15:37:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:05,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-11 15:37:05,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:37:05,276 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 15 treesize of output 1 [2024-11-11 15:37:05,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:37:05,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 22 [2024-11-11 15:37:05,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:37:05,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-11 15:37:05,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:37:05,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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-11 15:37:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:37:06,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:37:06,970 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 176 treesize of output 156 [2024-11-11 15:37:06,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:37:06,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 117 treesize of output 107 [2024-11-11 15:37:07,063 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 15:37:07,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399818301] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:37:07,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 15:37:07,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22, 19] total 52 [2024-11-11 15:37:07,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300329697] [2024-11-11 15:37:07,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 15:37:07,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-11 15:37:07,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:37:07,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-11 15:37:07,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=2316, Unknown=0, NotChecked=0, Total=2652 [2024-11-11 15:37:07,066 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 52 states, 50 states have (on average 2.2) internal successors, (110), 49 states have internal predecessors, (110), 7 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 15:37:09,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:37:09,630 INFO L93 Difference]: Finished difference Result 277 states and 381 transitions. [2024-11-11 15:37:09,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-11 15:37:09,631 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 2.2) internal successors, (110), 49 states have internal predecessors, (110), 7 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) Word has length 49 [2024-11-11 15:37:09,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:37:09,635 INFO L225 Difference]: With dead ends: 277 [2024-11-11 15:37:09,636 INFO L226 Difference]: Without dead ends: 218 [2024-11-11 15:37:09,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2182 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=812, Invalid=5508, Unknown=0, NotChecked=0, Total=6320 [2024-11-11 15:37:09,641 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 290 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:37:09,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 523 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 15:37:09,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-11 15:37:09,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 181. [2024-11-11 15:37:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 153 states have (on average 1.2352941176470589) internal successors, (189), 160 states have internal predecessors, (189), 16 states have call successors, (16), 5 states have call predecessors, (16), 11 states have return successors, (55), 15 states have call predecessors, (55), 16 states have call successors, (55) [2024-11-11 15:37:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 260 transitions. [2024-11-11 15:37:09,695 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 260 transitions. Word has length 49 [2024-11-11 15:37:09,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:37:09,696 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 260 transitions. [2024-11-11 15:37:09,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 2.2) internal successors, (110), 49 states have internal predecessors, (110), 7 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 15:37:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 260 transitions. [2024-11-11 15:37:09,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-11 15:37:09,698 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:37:09,698 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 15:37:09,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 15:37:09,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:37:09,899 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:37:09,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:37:09,900 INFO L85 PathProgramCache]: Analyzing trace with hash -292912813, now seen corresponding path program 2 times [2024-11-11 15:37:09,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:37:09,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991888020] [2024-11-11 15:37:09,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:37:09,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:37:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:10,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 15:37:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:10,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 15:37:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:10,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 15:37:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:37:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 15:37:10,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:37:10,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991888020] [2024-11-11 15:37:10,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991888020] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:37:10,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005202564] [2024-11-11 15:37:10,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 15:37:10,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:37:10,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:37:10,715 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:37:10,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 15:37:10,776 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 15:37:10,776 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 15:37:10,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-11 15:37:10,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:37:10,819 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 15 treesize of output 1 [2024-11-11 15:37:10,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:37:10,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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-11 15:37:11,181 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 15:37:11,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:37:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 15:37:11,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005202564] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:37:11,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 15:37:11,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 10] total 35 [2024-11-11 15:37:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615080904] [2024-11-11 15:37:11,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 15:37:11,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-11 15:37:11,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:37:11,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-11 15:37:11,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2024-11-11 15:37:11,516 INFO L87 Difference]: Start difference. First operand 181 states and 260 transitions. Second operand has 35 states, 35 states have (on average 2.914285714285714) internal successors, (102), 34 states have internal predecessors, (102), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 15:37:15,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 15:37:19,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 15:37:23,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 15:37:27,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 15:37:31,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 15:37:35,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 15:37:40,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 15:37:44,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 15:37:48,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 15:37:52,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 15:37:56,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 15:38:00,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 15:38:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:38:00,526 INFO L93 Difference]: Finished difference Result 388 states and 521 transitions. [2024-11-11 15:38:00,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-11 15:38:00,528 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.914285714285714) internal successors, (102), 34 states have internal predecessors, (102), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) Word has length 49 [2024-11-11 15:38:00,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:38:00,531 INFO L225 Difference]: With dead ends: 388 [2024-11-11 15:38:00,531 INFO L226 Difference]: Without dead ends: 236 [2024-11-11 15:38:00,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=339, Invalid=2211, Unknown=0, NotChecked=0, Total=2550 [2024-11-11 15:38:00,540 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 134 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 62 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.6s IncrementalHoareTripleChecker+Time [2024-11-11 15:38:00,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 388 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 774 Invalid, 12 Unknown, 0 Unchecked, 48.6s Time] [2024-11-11 15:38:00,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-11 15:38:00,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 206. [2024-11-11 15:38:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 175 states have (on average 1.2228571428571429) internal successors, (214), 182 states have internal predecessors, (214), 17 states have call successors, (17), 7 states have call predecessors, (17), 13 states have return successors, (48), 16 states have call predecessors, (48), 17 states have call successors, (48) [2024-11-11 15:38:00,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 279 transitions. [2024-11-11 15:38:00,577 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 279 transitions. Word has length 49 [2024-11-11 15:38:00,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:38:00,577 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 279 transitions. [2024-11-11 15:38:00,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.914285714285714) internal successors, (102), 34 states have internal predecessors, (102), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 15:38:00,577 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 279 transitions. [2024-11-11 15:38:00,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 15:38:00,579 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:38:00,579 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2024-11-11 15:38:00,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 15:38:00,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:38:00,783 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:38:00,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:38:00,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2132276289, now seen corresponding path program 1 times [2024-11-11 15:38:00,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:38:00,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773020920] [2024-11-11 15:38:00,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:38:00,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:38:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:38:02,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 15:38:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:38:02,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 15:38:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:38:02,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 15:38:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:38:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 15:38:02,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:38:02,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773020920] [2024-11-11 15:38:02,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773020920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:38:02,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91810872] [2024-11-11 15:38:02,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:38:02,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:38:02,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:38:02,968 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:38:02,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 15:38:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:38:03,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-11 15:38:03,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:38:03,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:38:03,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 40 [2024-11-11 15:38:03,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 65 [2024-11-11 15:38:03,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 15:38:03,938 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-11 15:38:03,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 72 [2024-11-11 15:38:04,161 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 124 treesize of output 76 [2024-11-11 15:38:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 15:38:04,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:38:05,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91810872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:38:05,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 15:38:05,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 45 [2024-11-11 15:38:05,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256083144] [2024-11-11 15:38:05,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 15:38:05,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-11 15:38:05,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:38:05,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-11 15:38:05,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2451, Unknown=0, NotChecked=0, Total=2652 [2024-11-11 15:38:05,281 INFO L87 Difference]: Start difference. First operand 206 states and 279 transitions. Second operand has 45 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 38 states have internal predecessors, (78), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 15:38:06,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:38:06,819 INFO L93 Difference]: Finished difference Result 322 states and 459 transitions. [2024-11-11 15:38:06,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-11 15:38:06,819 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 38 states have internal predecessors, (78), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2024-11-11 15:38:06,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:38:06,821 INFO L225 Difference]: With dead ends: 322 [2024-11-11 15:38:06,821 INFO L226 Difference]: Without dead ends: 318 [2024-11-11 15:38:06,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=370, Invalid=3790, Unknown=0, NotChecked=0, Total=4160 [2024-11-11 15:38:06,823 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 91 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 15:38:06,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 195 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 15:38:06,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-11 15:38:06,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 258. [2024-11-11 15:38:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 219 states have (on average 1.2511415525114156) internal successors, (274), 230 states have internal predecessors, (274), 21 states have call successors, (21), 7 states have call predecessors, (21), 17 states have return successors, (75), 20 states have call predecessors, (75), 21 states have call successors, (75) [2024-11-11 15:38:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 370 transitions. [2024-11-11 15:38:06,856 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 370 transitions. Word has length 51 [2024-11-11 15:38:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:38:06,856 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 370 transitions. [2024-11-11 15:38:06,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 38 states have internal predecessors, (78), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 15:38:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 370 transitions. [2024-11-11 15:38:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 15:38:06,858 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:38:06,858 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:38:06,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 15:38:07,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:38:07,063 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:38:07,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:38:07,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1947293477, now seen corresponding path program 3 times [2024-11-11 15:38:07,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:38:07,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389061850] [2024-11-11 15:38:07,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:38:07,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:38:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:38:07,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 15:38:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:38:07,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 15:38:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:38:07,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 15:38:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:38:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 15:38:07,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:38:07,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389061850] [2024-11-11 15:38:07,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389061850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:38:07,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588509431] [2024-11-11 15:38:07,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 15:38:07,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:38:07,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:38:07,154 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:38:07,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 15:38:07,215 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-11 15:38:07,216 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 15:38:07,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 15:38:07,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:38:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 15:38:07,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:38:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 15:38:07,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588509431] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:38:07,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 15:38:07,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14 [2024-11-11 15:38:07,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936544760] [2024-11-11 15:38:07,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 15:38:07,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 15:38:07,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:38:07,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 15:38:07,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-11 15:38:07,401 INFO L87 Difference]: Start difference. First operand 258 states and 370 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-11 15:38:07,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:38:07,584 INFO L93 Difference]: Finished difference Result 560 states and 795 transitions. [2024-11-11 15:38:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 15:38:07,584 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 51 [2024-11-11 15:38:07,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:38:07,587 INFO L225 Difference]: With dead ends: 560 [2024-11-11 15:38:07,587 INFO L226 Difference]: Without dead ends: 444 [2024-11-11 15:38:07,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2024-11-11 15:38:07,588 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 80 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:38:07,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 322 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:38:07,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-11 15:38:07,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 377. [2024-11-11 15:38:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 327 states have (on average 1.2507645259938838) internal successors, (409), 341 states have internal predecessors, (409), 26 states have call successors, (26), 10 states have call predecessors, (26), 23 states have return successors, (102), 25 states have call predecessors, (102), 26 states have call successors, (102) [2024-11-11 15:38:07,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 537 transitions. [2024-11-11 15:38:07,633 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 537 transitions. Word has length 51 [2024-11-11 15:38:07,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:38:07,633 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 537 transitions. [2024-11-11 15:38:07,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-11 15:38:07,638 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 537 transitions. [2024-11-11 15:38:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 15:38:07,643 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:38:07,643 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 15:38:07,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-11 15:38:07,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:38:07,844 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:38:07,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:38:07,845 INFO L85 PathProgramCache]: Analyzing trace with hash 110150350, now seen corresponding path program 1 times [2024-11-11 15:38:07,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:38:07,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060444352] [2024-11-11 15:38:07,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:38:07,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:38:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:38:08,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 15:38:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:38:08,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 15:38:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:38:08,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 15:38:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:38:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 15:38:08,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:38:08,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060444352] [2024-11-11 15:38:08,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060444352] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:38:08,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700631884] [2024-11-11 15:38:08,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:38:08,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:38:08,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:38:08,445 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:38:08,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 15:38:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:38:08,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-11 15:38:08,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:38:08,550 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 15 treesize of output 1 [2024-11-11 15:38:08,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:38:08,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2024-11-11 15:38:08,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:38:08,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2024-11-11 15:38:08,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:38:08,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2024-11-11 15:38:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 15:38:08,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:38:09,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700631884] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:38:09,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 15:38:09,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 27 [2024-11-11 15:38:09,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316981060] [2024-11-11 15:38:09,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 15:38:09,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-11 15:38:09,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:38:09,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-11 15:38:09,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2024-11-11 15:38:09,026 INFO L87 Difference]: Start difference. First operand 377 states and 537 transitions. Second operand has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 26 states have internal predecessors, (83), 2 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 15:38:13,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 15:38:17,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 15:38:17,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:38:17,590 INFO L93 Difference]: Finished difference Result 498 states and 691 transitions. [2024-11-11 15:38:17,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 15:38:17,590 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 26 states have internal predecessors, (83), 2 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 52 [2024-11-11 15:38:17,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:38:17,593 INFO L225 Difference]: With dead ends: 498 [2024-11-11 15:38:17,593 INFO L226 Difference]: Without dead ends: 458 [2024-11-11 15:38:17,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=1063, Unknown=0, NotChecked=0, Total=1260 [2024-11-11 15:38:17,595 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 122 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 30 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-11 15:38:17,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 231 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 422 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2024-11-11 15:38:17,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-11 15:38:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 445. [2024-11-11 15:38:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 387 states have (on average 1.2583979328165376) internal successors, (487), 407 states have internal predecessors, (487), 29 states have call successors, (29), 12 states have call predecessors, (29), 28 states have return successors, (106), 25 states have call predecessors, (106), 29 states have call successors, (106) [2024-11-11 15:38:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 622 transitions. [2024-11-11 15:38:17,631 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 622 transitions. Word has length 52 [2024-11-11 15:38:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:38:17,631 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 622 transitions. [2024-11-11 15:38:17,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 26 states have internal predecessors, (83), 2 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 15:38:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 622 transitions. [2024-11-11 15:38:17,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 15:38:17,633 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:38:17,633 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 15:38:17,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-11 15:38:17,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-11 15:38:17,838 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:38:17,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:38:17,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1069560756, now seen corresponding path program 1 times [2024-11-11 15:38:17,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:38:17,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697088005] [2024-11-11 15:38:17,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:38:17,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:38:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 15:38:17,862 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 15:38:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 15:38:17,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 15:38:17,917 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 15:38:17,918 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 15:38:17,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 15:38:17,923 INFO L421 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:38:17,967 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 15:38:17,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 03:38:17 BoogieIcfgContainer [2024-11-11 15:38:17,971 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 15:38:17,973 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 15:38:17,973 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 15:38:17,973 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 15:38:17,973 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:37:00" (3/4) ... [2024-11-11 15:38:17,975 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-11 15:38:17,976 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 15:38:17,977 INFO L158 Benchmark]: Toolchain (without parser) took 77874.57ms. Allocated memory was 159.4MB in the beginning and 356.5MB in the end (delta: 197.1MB). Free memory was 84.7MB in the beginning and 230.3MB in the end (delta: -145.6MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. [2024-11-11 15:38:17,977 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 159.4MB. Free memory was 109.9MB in the beginning and 109.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 15:38:17,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.19ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 71.6MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 15:38:17,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.89ms. Allocated memory is still 159.4MB. Free memory was 71.6MB in the beginning and 69.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 15:38:17,977 INFO L158 Benchmark]: Boogie Preprocessor took 52.15ms. Allocated memory is still 159.4MB. Free memory was 69.8MB in the beginning and 67.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 15:38:17,978 INFO L158 Benchmark]: RCFGBuilder took 390.61ms. Allocated memory was 159.4MB in the beginning and 245.4MB in the end (delta: 86.0MB). Free memory was 67.7MB in the beginning and 211.2MB in the end (delta: -143.5MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-11-11 15:38:17,978 INFO L158 Benchmark]: TraceAbstraction took 77114.82ms. Allocated memory was 245.4MB in the beginning and 356.5MB in the end (delta: 111.1MB). Free memory was 211.2MB in the beginning and 230.3MB in the end (delta: -19.0MB). Peak memory consumption was 91.1MB. Max. memory is 16.1GB. [2024-11-11 15:38:17,978 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 356.5MB. Free memory is still 230.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 15:38:17,979 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.69ms. Allocated memory is still 159.4MB. Free memory was 109.9MB in the beginning and 109.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.19ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 71.6MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.89ms. Allocated memory is still 159.4MB. Free memory was 71.6MB in the beginning and 69.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.15ms. Allocated memory is still 159.4MB. Free memory was 69.8MB in the beginning and 67.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 390.61ms. Allocated memory was 159.4MB in the beginning and 245.4MB in the end (delta: 86.0MB). Free memory was 67.7MB in the beginning and 211.2MB in the end (delta: -143.5MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * TraceAbstraction took 77114.82ms. Allocated memory was 245.4MB in the beginning and 356.5MB in the end (delta: 111.1MB). Free memory was 211.2MB in the beginning and 230.3MB in the end (delta: -19.0MB). Peak memory consumption was 91.1MB. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 356.5MB. Free memory is still 230.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 57]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 25. Possible FailurePath: [L17] int N; VAL [N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; [L35] int temp; [L36] int ret; [L37] int ret2; [L38] int ret5; [L40] int i = 0; VAL [N=2, i=0, x={9:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [N=2, i=1, x={9:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [N=2, i=2, x={9:0}] [L40] COND FALSE !(i < N) VAL [N=2, x={9:0}] [L45] CALL, EXPR bAnd(x) VAL [N=2, \old(x)={9:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [N=2, \old(x)={9:0}, i=1, res=-2147483647, x={9:0}] [L24] COND TRUE i < N [L25] EXPR x[i] VAL [N=2, \old(x)={9:0}, i=1, res=-2147483647, x={9:0}] [L25] EXPR res & x[i] VAL [N=2, \old(x)={9:0}, i=1, x={9:0}] [L25] res = res & x[i] [L24] i++ VAL [N=2, \old(x)={9:0}, i=2, res=1, x={9:0}] [L24] COND FALSE !(i < N) VAL [N=2, \old(x)={9:0}, res=1, x={9:0}] [L27] return res; VAL [N=2, \old(x)={9:0}, \result=1, x={9:0}] [L45] RET, EXPR bAnd(x) VAL [N=2, x={9:0}] [L45] ret = bAnd(x) [L47] EXPR x[0] [L47] temp=x[0] [L47] EXPR x[1] [L47] x[0] = x[1] [L47] x[1] = temp VAL [N=2] [L48] CALL, EXPR bAnd(x) VAL [N=2, \old(x)={9:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [N=2, \old(x)={9:0}, i=1, res=2147483647, x={9:0}] [L24] COND TRUE i < N [L25] EXPR x[i] VAL [N=2, \old(x)={9:0}, i=1, res=2147483647, x={9:0}] [L25] EXPR res & x[i] VAL [N=2, \old(x)={9:0}, i=1, x={9:0}] [L25] res = res & x[i] [L24] i++ VAL [N=2, \old(x)={9:0}, i=2, res=2147483647, x={9:0}] [L24] COND FALSE !(i < N) VAL [N=2, \old(x)={9:0}, res=2147483647, x={9:0}] [L27] return res; VAL [N=2, \old(x)={9:0}, \result=2147483647, x={9:0}] [L48] RET, EXPR bAnd(x) VAL [N=2, ret=1, x={9:0}] [L48] ret2 = bAnd(x) [L49] EXPR x[0] [L49] temp=x[0] [L50] int i =0 ; VAL [N=2, i=0, ret2=2147483647, ret=1, temp=2147483647, x={9:0}] [L50] COND TRUE i 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 -> d475be4701a825f0568ebf884900dce77e1216a215283bc51d05a41cc9a8ddb5 [2024-11-11 15:38:20,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 15:38:20,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 15:38:20,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 15:38:20,434 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 15:38:20,435 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 15:38:20,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/bAnd5.i [2024-11-11 15:38:21,926 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 15:38:22,091 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 15:38:22,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i [2024-11-11 15:38:22,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5531ddba9/cb92bb505459455d8ef5a58fa0d8280e/FLAGace7b86b9 [2024-11-11 15:38:22,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5531ddba9/cb92bb505459455d8ef5a58fa0d8280e [2024-11-11 15:38:22,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 15:38:22,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 15:38:22,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 15:38:22,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 15:38:22,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 15:38:22,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 03:38:22" (1/1) ... [2024-11-11 15:38:22,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a640b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:38:22, skipping insertion in model container [2024-11-11 15:38:22,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 03:38:22" (1/1) ... [2024-11-11 15:38:22,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 15:38:22,712 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/array-crafted/bAnd5.i[1369,1382] [2024-11-11 15:38:22,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 15:38:22,727 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 15:38:22,753 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/array-crafted/bAnd5.i[1369,1382] [2024-11-11 15:38:22,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 15:38:22,774 INFO L204 MainTranslator]: Completed translation [2024-11-11 15:38:22,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:38:22 WrapperNode [2024-11-11 15:38:22,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 15:38:22,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 15:38:22,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 15:38:22,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 15:38:22,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:38:22" (1/1) ... [2024-11-11 15:38:22,788 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:38:22" (1/1) ... [2024-11-11 15:38:22,807 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2024-11-11 15:38:22,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 15:38:22,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 15:38:22,809 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 15:38:22,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 15:38:22,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:38:22" (1/1) ... [2024-11-11 15:38:22,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:38:22" (1/1) ... [2024-11-11 15:38:22,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:38:22" (1/1) ... [2024-11-11 15:38:22,843 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 5 writes are split as follows [0, 0, 5]. [2024-11-11 15:38:22,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:38:22" (1/1) ... [2024-11-11 15:38:22,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:38:22" (1/1) ... [2024-11-11 15:38:22,850 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:38:22" (1/1) ... [2024-11-11 15:38:22,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:38:22" (1/1) ... [2024-11-11 15:38:22,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:38:22" (1/1) ... [2024-11-11 15:38:22,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:38:22" (1/1) ... [2024-11-11 15:38:22,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 15:38:22,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 15:38:22,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 15:38:22,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 15:38:22,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:38:22" (1/1) ... [2024-11-11 15:38:22,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 15:38:22,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:38:22,899 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-11 15:38:22,906 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-11 15:38:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 15:38:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-11 15:38:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-11 15:38:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-11 15:38:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 15:38:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-11 15:38:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-11 15:38:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-11 15:38:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2024-11-11 15:38:22,948 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2024-11-11 15:38:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 15:38:22,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 15:38:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 15:38:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-11 15:38:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-11 15:38:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-11 15:38:23,036 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 15:38:23,038 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 15:38:23,236 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-11 15:38:23,236 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 15:38:23,252 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 15:38:23,256 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-11 15:38:23,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:38:23 BoogieIcfgContainer [2024-11-11 15:38:23,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 15:38:23,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 15:38:23,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 15:38:23,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 15:38:23,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 03:38:22" (1/3) ... [2024-11-11 15:38:23,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103f66c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 03:38:23, skipping insertion in model container [2024-11-11 15:38:23,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:38:22" (2/3) ... [2024-11-11 15:38:23,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103f66c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 03:38:23, skipping insertion in model container [2024-11-11 15:38:23,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:38:23" (3/3) ... [2024-11-11 15:38:23,267 INFO L112 eAbstractionObserver]: Analyzing ICFG bAnd5.i [2024-11-11 15:38:23,281 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 15:38:23,281 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 15:38:23,335 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 15:38:23,340 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;@4707348c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 15:38:23,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 15:38:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 15:38:23,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-11 15:38:23,350 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:38:23,350 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:38:23,350 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:38:23,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:38:23,355 INFO L85 PathProgramCache]: Analyzing trace with hash 466257350, now seen corresponding path program 1 times [2024-11-11 15:38:23,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:38:23,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660462620] [2024-11-11 15:38:23,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:38:23,369 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-11 15:38:23,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:38:23,371 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-11 15:38:23,373 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-11 15:38:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:38:23,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 15:38:23,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:38:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 15:38:23,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:38:23,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:38:23,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660462620] [2024-11-11 15:38:23,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660462620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:38:23,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:38:23,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 15:38:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528496267] [2024-11-11 15:38:23,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:38:23,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 15:38:23,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:38:23,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 15:38:23,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 15:38:23,543 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 15:38:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:38:23,569 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2024-11-11 15:38:23,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 15:38:23,571 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-11-11 15:38:23,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:38:23,576 INFO L225 Difference]: With dead ends: 53 [2024-11-11 15:38:23,576 INFO L226 Difference]: Without dead ends: 24 [2024-11-11 15:38:23,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-11 15:38:23,583 INFO L435 NwaCegarLoop]: 34 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, 34 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-11 15:38:23,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:38:23,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-11 15:38:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-11 15:38:23,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 15:38:23,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-11 15:38:23,611 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 30 [2024-11-11 15:38:23,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:38:23,612 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-11 15:38:23,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 15:38:23,612 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-11 15:38:23,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-11 15:38:23,613 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:38:23,614 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:38:23,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-11 15:38:23,815 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-11 15:38:23,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:38:23,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:38:23,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1183314106, now seen corresponding path program 1 times [2024-11-11 15:38:23,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:38:23,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228478666] [2024-11-11 15:38:23,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:38:23,816 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-11 15:38:23,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:38:23,819 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-11 15:38:23,820 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-11 15:38:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:38:23,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 15:38:23,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:38:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 15:38:23,921 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:38:23,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:38:23,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228478666] [2024-11-11 15:38:23,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228478666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:38:23,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:38:23,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 15:38:23,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140495633] [2024-11-11 15:38:23,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:38:23,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 15:38:23,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:38:23,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 15:38:23,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 15:38:23,928 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 15:38:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:38:23,966 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2024-11-11 15:38:23,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 15:38:23,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2024-11-11 15:38:23,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:38:23,969 INFO L225 Difference]: With dead ends: 45 [2024-11-11 15:38:23,969 INFO L226 Difference]: Without dead ends: 26 [2024-11-11 15:38:23,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 15:38:23,970 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:38:23,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:38:23,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-11 15:38:23,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-11 15:38:23,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 15:38:23,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-11 15:38:23,978 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 30 [2024-11-11 15:38:23,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:38:23,978 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-11 15:38:23,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 15:38:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-11 15:38:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-11 15:38:23,981 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:38:23,981 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:38:23,989 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-11 15:38:24,181 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-11 15:38:24,183 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:38:24,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:38:24,183 INFO L85 PathProgramCache]: Analyzing trace with hash -590255016, now seen corresponding path program 1 times [2024-11-11 15:38:24,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:38:24,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791756335] [2024-11-11 15:38:24,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:38:24,184 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-11 15:38:24,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:38:24,185 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-11 15:38:24,187 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-11 15:38:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:38:24,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 15:38:24,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:38:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 15:38:24,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:38:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 15:38:24,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:38:24,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791756335] [2024-11-11 15:38:24,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791756335] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:38:24,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 15:38:24,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-11 15:38:24,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567042356] [2024-11-11 15:38:24,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 15:38:24,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 15:38:24,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:38:24,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 15:38:24,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 15:38:24,329 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-11 15:38:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:38:24,384 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2024-11-11 15:38:24,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 15:38:24,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 32 [2024-11-11 15:38:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:38:24,385 INFO L225 Difference]: With dead ends: 47 [2024-11-11 15:38:24,385 INFO L226 Difference]: Without dead ends: 28 [2024-11-11 15:38:24,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 15:38:24,390 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:38:24,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:38:24,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-11 15:38:24,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-11 15:38:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 15:38:24,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-11 15:38:24,398 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2024-11-11 15:38:24,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:38:24,398 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-11 15:38:24,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-11 15:38:24,398 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-11 15:38:24,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-11 15:38:24,399 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:38:24,399 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:38:24,409 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 (4)] Forceful destruction successful, exit code 0 [2024-11-11 15:38:24,599 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-11 15:38:24,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:38:24,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:38:24,601 INFO L85 PathProgramCache]: Analyzing trace with hash 111835254, now seen corresponding path program 2 times [2024-11-11 15:38:24,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:38:24,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146293400] [2024-11-11 15:38:24,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 15:38:24,602 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-11 15:38:24,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:38:24,606 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-11 15:38:24,607 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-11 15:38:24,649 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-11 15:38:24,649 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 15:38:24,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 15:38:24,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:38:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 15:38:24,708 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:38:24,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:38:24,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146293400] [2024-11-11 15:38:24,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146293400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:38:24,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:38:24,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 15:38:24,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761925648] [2024-11-11 15:38:24,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:38:24,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:38:24,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:38:24,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:38:24,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:38:24,710 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 15:38:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:38:24,752 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2024-11-11 15:38:24,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 15:38:24,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2024-11-11 15:38:24,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:38:24,754 INFO L225 Difference]: With dead ends: 46 [2024-11-11 15:38:24,754 INFO L226 Difference]: Without dead ends: 29 [2024-11-11 15:38:24,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:38:24,755 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:38:24,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 30 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:38:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-11 15:38:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-11 15:38:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 15:38:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-11 15:38:24,759 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2024-11-11 15:38:24,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:38:24,759 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-11 15:38:24,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 15:38:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-11 15:38:24,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-11 15:38:24,760 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:38:24,760 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:38:24,763 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-11 15:38:24,962 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-11 15:38:24,963 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:38:24,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:38:24,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1766573260, now seen corresponding path program 1 times [2024-11-11 15:38:24,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:38:24,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270789218] [2024-11-11 15:38:24,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:38:24,964 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-11 15:38:24,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:38:24,966 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-11 15:38:24,968 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-11 15:38:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:38:25,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 15:38:25,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:38:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 15:38:25,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:38:25,319 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 15:38:25,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:38:25,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270789218] [2024-11-11 15:38:25,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270789218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:38:25,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 15:38:25,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-11 15:38:25,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282741885] [2024-11-11 15:38:25,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 15:38:25,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 15:38:25,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:38:25,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 15:38:25,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-11 15:38:25,323 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 15:38:25,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:38:25,502 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2024-11-11 15:38:25,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 15:38:25,502 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2024-11-11 15:38:25,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:38:25,503 INFO L225 Difference]: With dead ends: 67 [2024-11-11 15:38:25,503 INFO L226 Difference]: Without dead ends: 54 [2024-11-11 15:38:25,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-11-11 15:38:25,504 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 68 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:38:25,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 74 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:38:25,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-11 15:38:25,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 29. [2024-11-11 15:38:25,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 15:38:25,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-11 15:38:25,513 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2024-11-11 15:38:25,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:38:25,515 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-11 15:38:25,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 15:38:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-11 15:38:25,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-11 15:38:25,517 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:38:25,517 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-11 15:38:25,521 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 (6)] Ended with exit code 0 [2024-11-11 15:38:25,720 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-11 15:38:25,721 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:38:25,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:38:25,721 INFO L85 PathProgramCache]: Analyzing trace with hash -572775278, now seen corresponding path program 1 times [2024-11-11 15:38:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:38:25,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972349055] [2024-11-11 15:38:25,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:38:25,722 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-11 15:38:25,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:38:25,724 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-11 15:38:25,725 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-11 15:38:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:38:25,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-11 15:38:25,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:38:26,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:38:26,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2024-11-11 15:38:26,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:38:26,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 34 [2024-11-11 15:38:26,644 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 15:38:26,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 15:38:26,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:38:26,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 58 [2024-11-11 15:38:26,862 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 15:38:26,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:38:26,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 28