./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.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 b855c2333aba0768da7f98c0f43af3ba5efb2578eeec0e9146f1a7f4f307c07a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 20:41:09,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 20:41:09,569 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 20:41:09,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 20:41:09,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 20:41:09,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 20:41:09,599 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 20:41:09,599 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 20:41:09,600 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 20:41:09,601 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 20:41:09,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 20:41:09,602 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 20:41:09,602 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 20:41:09,603 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 20:41:09,603 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 20:41:09,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 20:41:09,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 20:41:09,607 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 20:41:09,607 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 20:41:09,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 20:41:09,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 20:41:09,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 20:41:09,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 20:41:09,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 20:41:09,608 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 20:41:09,609 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 20:41:09,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 20:41:09,609 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 20:41:09,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 20:41:09,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 20:41:09,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 20:41:09,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 20:41:09,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 20:41:09,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 20:41:09,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 20:41:09,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 20:41:09,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 20:41:09,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 20:41:09,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 20:41:09,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 20:41:09,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 20:41:09,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 20:41:09,613 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 -> b855c2333aba0768da7f98c0f43af3ba5efb2578eeec0e9146f1a7f4f307c07a [2024-11-21 20:41:09,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 20:41:09,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 20:41:09,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 20:41:09,868 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 20:41:09,868 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 20:41:09,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i [2024-11-21 20:41:11,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 20:41:11,327 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 20:41:11,328 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i [2024-11-21 20:41:11,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64e0b8df2/c38420f0643146e2b116b59fd4646226/FLAG77fa60208 [2024-11-21 20:41:11,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64e0b8df2/c38420f0643146e2b116b59fd4646226 [2024-11-21 20:41:11,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 20:41:11,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 20:41:11,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 20:41:11,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 20:41:11,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 20:41:11,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:41:11" (1/1) ... [2024-11-21 20:41:11,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42edbf79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:41:11, skipping insertion in model container [2024-11-21 20:41:11,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:41:11" (1/1) ... [2024-11-21 20:41:11,768 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 20:41:11,891 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-industry-pattern/array_of_struct_ptr_flag_init.i[959,972] [2024-11-21 20:41:11,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 20:41:11,911 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 20:41:11,920 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-industry-pattern/array_of_struct_ptr_flag_init.i[959,972] [2024-11-21 20:41:11,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 20:41:11,935 INFO L204 MainTranslator]: Completed translation [2024-11-21 20:41:11,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:41:11 WrapperNode [2024-11-21 20:41:11,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 20:41:11,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 20:41:11,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 20:41:11,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 20:41:11,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:41:11" (1/1) ... [2024-11-21 20:41:11,945 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:41:11" (1/1) ... [2024-11-21 20:41:11,956 INFO L138 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2024-11-21 20:41:11,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 20:41:11,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 20:41:11,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 20:41:11,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 20:41:11,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:41:11" (1/1) ... [2024-11-21 20:41:11,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:41:11" (1/1) ... [2024-11-21 20:41:11,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:41:11" (1/1) ... [2024-11-21 20:41:11,973 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-21 20:41:11,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:41:11" (1/1) ... [2024-11-21 20:41:11,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:41:11" (1/1) ... [2024-11-21 20:41:11,977 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:41:11" (1/1) ... [2024-11-21 20:41:11,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:41:11" (1/1) ... [2024-11-21 20:41:11,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:41:11" (1/1) ... [2024-11-21 20:41:11,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:41:11" (1/1) ... [2024-11-21 20:41:12,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 20:41:12,002 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 20:41:12,002 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 20:41:12,002 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 20:41:12,002 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:41:11" (1/1) ... [2024-11-21 20:41:12,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 20:41:12,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:41:12,071 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-21 20:41:12,073 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-21 20:41:12,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-21 20:41:12,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-21 20:41:12,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 20:41:12,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 20:41:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-21 20:41:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-21 20:41:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-21 20:41:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-21 20:41:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-21 20:41:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 20:41:12,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 20:41:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-21 20:41:12,177 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 20:41:12,179 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 20:41:12,298 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-21 20:41:12,299 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 20:41:12,308 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 20:41:12,308 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-21 20:41:12,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:41:12 BoogieIcfgContainer [2024-11-21 20:41:12,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 20:41:12,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 20:41:12,310 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 20:41:12,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 20:41:12,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 08:41:11" (1/3) ... [2024-11-21 20:41:12,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad11f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:41:12, skipping insertion in model container [2024-11-21 20:41:12,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:41:11" (2/3) ... [2024-11-21 20:41:12,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad11f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:41:12, skipping insertion in model container [2024-11-21 20:41:12,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:41:12" (3/3) ... [2024-11-21 20:41:12,315 INFO L112 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init.i [2024-11-21 20:41:12,328 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 20:41:12,328 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 20:41:12,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 20:41:12,382 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;@42158816, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 20:41:12,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 20:41:12,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:12,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-21 20:41:12,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:41:12,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:41:12,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:41:12,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:41:12,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2060710478, now seen corresponding path program 1 times [2024-11-21 20:41:12,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:41:12,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501719737] [2024-11-21 20:41:12,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:41:12,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:41:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:41:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 20:41:12,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:41:12,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501719737] [2024-11-21 20:41:12,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501719737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:41:12,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:41:12,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 20:41:12,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951299060] [2024-11-21 20:41:12,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:41:12,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 20:41:12,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:41:12,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 20:41:12,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 20:41:12,644 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:41:12,670 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2024-11-21 20:41:12,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 20:41:12,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-21 20:41:12,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:41:12,679 INFO L225 Difference]: With dead ends: 38 [2024-11-21 20:41:12,679 INFO L226 Difference]: Without dead ends: 18 [2024-11-21 20:41:12,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 20:41:12,683 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:41:12,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:41:12,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-21 20:41:12,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-11-21 20:41:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-11-21 20:41:12,707 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2024-11-21 20:41:12,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:41:12,707 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-21 20:41:12,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:12,708 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-11-21 20:41:12,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-21 20:41:12,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:41:12,710 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:41:12,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 20:41:12,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:41:12,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:41:12,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1264138591, now seen corresponding path program 1 times [2024-11-21 20:41:12,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:41:12,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772275113] [2024-11-21 20:41:12,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:41:12,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:41:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:41:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-21 20:41:12,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:41:12,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772275113] [2024-11-21 20:41:12,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772275113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:41:12,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:41:12,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 20:41:12,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754700168] [2024-11-21 20:41:12,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:41:12,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 20:41:12,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:41:12,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 20:41:12,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 20:41:12,814 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:12,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:41:12,834 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-21 20:41:12,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 20:41:12,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-21 20:41:12,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:41:12,836 INFO L225 Difference]: With dead ends: 35 [2024-11-21 20:41:12,837 INFO L226 Difference]: Without dead ends: 27 [2024-11-21 20:41:12,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 20:41:12,838 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:41:12,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 26 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:41:12,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-21 20:41:12,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2024-11-21 20:41:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-21 20:41:12,844 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2024-11-21 20:41:12,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:41:12,844 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-21 20:41:12,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-21 20:41:12,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-21 20:41:12,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:41:12,845 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:41:12,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 20:41:12,846 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:41:12,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:41:12,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1458340319, now seen corresponding path program 1 times [2024-11-21 20:41:12,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:41:12,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434703633] [2024-11-21 20:41:12,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:41:12,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:41:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:41:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-21 20:41:12,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:41:12,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434703633] [2024-11-21 20:41:12,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434703633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:41:12,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057560432] [2024-11-21 20:41:12,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:41:12,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:41:12,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:41:12,918 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-21 20:41:12,923 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-21 20:41:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:41:12,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 20:41:12,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:41:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-21 20:41:13,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 20:41:13,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057560432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:41:13,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 20:41:13,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-21 20:41:13,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762834538] [2024-11-21 20:41:13,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:41:13,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 20:41:13,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:41:13,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 20:41:13,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 20:41:13,010 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:13,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:41:13,020 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-11-21 20:41:13,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 20:41:13,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-21 20:41:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:41:13,021 INFO L225 Difference]: With dead ends: 32 [2024-11-21 20:41:13,021 INFO L226 Difference]: Without dead ends: 18 [2024-11-21 20:41:13,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 20:41:13,022 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:41:13,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 38 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:41:13,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-21 20:41:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-21 20:41:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-21 20:41:13,026 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2024-11-21 20:41:13,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:41:13,026 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-21 20:41:13,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-11-21 20:41:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-21 20:41:13,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:41:13,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:41:13,036 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-21 20:41:13,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:41:13,228 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:41:13,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:41:13,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2027280351, now seen corresponding path program 1 times [2024-11-21 20:41:13,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:41:13,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566465616] [2024-11-21 20:41:13,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:41:13,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:41:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:41:13,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-21 20:41:13,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:41:13,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566465616] [2024-11-21 20:41:13,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566465616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:41:13,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671531357] [2024-11-21 20:41:13,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:41:13,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:41:13,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:41:13,282 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-21 20:41:13,283 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-21 20:41:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:41:13,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-21 20:41:13,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:41:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-21 20:41:13,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:41:13,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-21 20:41:13,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671531357] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:41:13,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:41:13,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-21 20:41:13,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549760836] [2024-11-21 20:41:13,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:41:13,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-21 20:41:13,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:41:13,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-21 20:41:13,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-21 20:41:13,468 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:41:13,541 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2024-11-21 20:41:13,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 20:41:13,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-21 20:41:13,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:41:13,542 INFO L225 Difference]: With dead ends: 56 [2024-11-21 20:41:13,543 INFO L226 Difference]: Without dead ends: 43 [2024-11-21 20:41:13,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-21 20:41:13,544 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:41:13,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 53 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:41:13,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-21 20:41:13,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2024-11-21 20:41:13,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:13,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-11-21 20:41:13,553 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 15 [2024-11-21 20:41:13,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:41:13,553 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-21 20:41:13,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:13,554 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-11-21 20:41:13,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-21 20:41:13,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:41:13,555 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:41:13,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-21 20:41:13,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-21 20:41:13,761 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:41:13,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:41:13,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2044266853, now seen corresponding path program 2 times [2024-11-21 20:41:13,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:41:13,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882132122] [2024-11-21 20:41:13,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:41:13,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:41:13,842 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:41:13,843 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:41:14,140 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-21 20:41:14,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:41:14,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882132122] [2024-11-21 20:41:14,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882132122] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:41:14,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979874127] [2024-11-21 20:41:14,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:41:14,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:41:14,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:41:14,145 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-21 20:41:14,150 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-21 20:41:14,221 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:41:14,221 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:41:14,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-21 20:41:14,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:41:14,319 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-21 20:41:14,322 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:41:14,417 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-21 20:41:14,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979874127] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:41:14,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:41:14,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-11-21 20:41:14,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562207235] [2024-11-21 20:41:14,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:41:14,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-21 20:41:14,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:41:14,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-21 20:41:14,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2024-11-21 20:41:14,423 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:41:14,472 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2024-11-21 20:41:14,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 20:41:14,473 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-21 20:41:14,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:41:14,474 INFO L225 Difference]: With dead ends: 55 [2024-11-21 20:41:14,474 INFO L226 Difference]: Without dead ends: 39 [2024-11-21 20:41:14,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2024-11-21 20:41:14,475 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:41:14,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:41:14,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-21 20:41:14,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-21 20:41:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:14,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-11-21 20:41:14,479 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2024-11-21 20:41:14,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:41:14,479 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-11-21 20:41:14,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:14,480 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-21 20:41:14,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-21 20:41:14,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:41:14,480 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:41:14,487 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-21 20:41:14,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:41:14,684 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:41:14,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:41:14,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2120045553, now seen corresponding path program 3 times [2024-11-21 20:41:14,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:41:14,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290407837] [2024-11-21 20:41:14,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 20:41:14,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:41:14,725 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-21 20:41:14,726 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:41:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-21 20:41:14,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:41:14,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290407837] [2024-11-21 20:41:14,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290407837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:41:14,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730145816] [2024-11-21 20:41:14,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 20:41:14,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:41:14,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:41:14,781 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-21 20:41:14,782 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-21 20:41:14,863 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-21 20:41:14,863 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:41:14,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-21 20:41:14,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:41:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-21 20:41:14,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:41:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-21 20:41:14,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730145816] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:41:14,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:41:14,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-21 20:41:14,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186526544] [2024-11-21 20:41:14,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:41:14,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 20:41:14,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:41:14,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 20:41:14,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-21 20:41:14,925 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:41:14,979 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2024-11-21 20:41:14,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 20:41:14,980 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-21 20:41:14,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:41:14,981 INFO L225 Difference]: With dead ends: 95 [2024-11-21 20:41:14,981 INFO L226 Difference]: Without dead ends: 87 [2024-11-21 20:41:14,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-21 20:41:14,982 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 74 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:41:14,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 56 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:41:14,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-21 20:41:14,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 51. [2024-11-21 20:41:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-11-21 20:41:14,991 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 36 [2024-11-21 20:41:14,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:41:14,991 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-11-21 20:41:14,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:14,992 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-11-21 20:41:14,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-21 20:41:14,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:41:14,993 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:41:15,003 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-21 20:41:15,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:41:15,197 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:41:15,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:41:15,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1460070641, now seen corresponding path program 4 times [2024-11-21 20:41:15,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:41:15,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266485601] [2024-11-21 20:41:15,198 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-21 20:41:15,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:41:15,249 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-21 20:41:15,249 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:41:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-21 20:41:15,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:41:15,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266485601] [2024-11-21 20:41:15,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266485601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:41:15,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738994423] [2024-11-21 20:41:15,427 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-21 20:41:15,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:41:15,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:41:15,429 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-21 20:41:15,431 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-21 20:41:15,683 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-21 20:41:15,684 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:41:15,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-21 20:41:15,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:41:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-21 20:41:15,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:41:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-21 20:41:15,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738994423] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:41:15,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:41:15,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-21 20:41:15,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3313032] [2024-11-21 20:41:15,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:41:15,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-21 20:41:15,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:41:15,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-21 20:41:15,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-11-21 20:41:15,813 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:15,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:41:15,916 INFO L93 Difference]: Finished difference Result 175 states and 200 transitions. [2024-11-21 20:41:15,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-21 20:41:15,916 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-21 20:41:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:41:15,917 INFO L225 Difference]: With dead ends: 175 [2024-11-21 20:41:15,918 INFO L226 Difference]: Without dead ends: 167 [2024-11-21 20:41:15,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-11-21 20:41:15,919 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 221 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:41:15,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 108 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:41:15,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-21 20:41:15,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 75. [2024-11-21 20:41:15,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:15,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-11-21 20:41:15,925 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 48 [2024-11-21 20:41:15,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:41:15,925 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-11-21 20:41:15,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:15,926 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-11-21 20:41:15,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-21 20:41:15,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:41:15,927 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:41:15,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-21 20:41:16,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:41:16,128 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:41:16,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:41:16,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2022468879, now seen corresponding path program 5 times [2024-11-21 20:41:16,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:41:16,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380421085] [2024-11-21 20:41:16,129 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-21 20:41:16,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:41:16,193 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2024-11-21 20:41:16,194 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:41:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-21 20:41:16,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:41:16,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380421085] [2024-11-21 20:41:16,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380421085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:41:16,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730039321] [2024-11-21 20:41:16,613 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-21 20:41:16,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:41:16,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:41:16,617 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-21 20:41:16,618 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-21 20:41:20,359 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2024-11-21 20:41:20,360 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:41:20,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-21 20:41:20,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:41:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-21 20:41:20,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:41:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-21 20:41:20,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730039321] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:41:20,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:41:20,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2024-11-21 20:41:20,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978238373] [2024-11-21 20:41:20,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:41:20,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-21 20:41:20,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:41:20,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-21 20:41:20,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2024-11-21 20:41:20,730 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 32 states, 32 states have (on average 3.0625) internal successors, (98), 32 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:20,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:41:20,962 INFO L93 Difference]: Finished difference Result 335 states and 384 transitions. [2024-11-21 20:41:20,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-21 20:41:20,963 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.0625) internal successors, (98), 32 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-21 20:41:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:41:20,965 INFO L225 Difference]: With dead ends: 335 [2024-11-21 20:41:20,965 INFO L226 Difference]: Without dead ends: 327 [2024-11-21 20:41:20,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2024-11-21 20:41:20,966 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 515 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-21 20:41:20,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 212 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-21 20:41:20,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-21 20:41:20,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 123. [2024-11-21 20:41:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:20,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 126 transitions. [2024-11-21 20:41:20,974 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 126 transitions. Word has length 72 [2024-11-21 20:41:20,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:41:20,975 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 126 transitions. [2024-11-21 20:41:20,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.0625) internal successors, (98), 32 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2024-11-21 20:41:20,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-21 20:41:20,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:41:20,977 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:41:20,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-21 20:41:21,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:41:21,182 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:41:21,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:41:21,183 INFO L85 PathProgramCache]: Analyzing trace with hash -810359055, now seen corresponding path program 6 times [2024-11-21 20:41:21,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:41:21,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651437370] [2024-11-21 20:41:21,184 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-21 20:41:21,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:41:21,206 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-21 20:41:21,206 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:41:21,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 1376 trivial. 0 not checked. [2024-11-21 20:41:21,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:41:21,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651437370] [2024-11-21 20:41:21,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651437370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:41:21,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640030338] [2024-11-21 20:41:21,421 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-21 20:41:21,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:41:21,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:41:21,427 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-21 20:41:21,428 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-21 20:41:21,525 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-21 20:41:21,526 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:41:21,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-21 20:41:21,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:41:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 1376 trivial. 0 not checked. [2024-11-21 20:41:21,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:41:22,279 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-21 20:41:22,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 19 [2024-11-21 20:41:22,285 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-21 20:41:22,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2024-11-21 20:41:22,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 29 proven. 30 refuted. 0 times theorem prover too weak. 1376 trivial. 0 not checked. [2024-11-21 20:41:22,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640030338] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:41:22,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:41:22,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2024-11-21 20:41:22,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223624716] [2024-11-21 20:41:22,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:41:22,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-21 20:41:22,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:41:22,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-21 20:41:22,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-21 20:41:22,295 INFO L87 Difference]: Start difference. First operand 123 states and 126 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:22,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:41:22,347 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2024-11-21 20:41:22,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 20:41:22,348 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2024-11-21 20:41:22,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:41:22,349 INFO L225 Difference]: With dead ends: 130 [2024-11-21 20:41:22,349 INFO L226 Difference]: Without dead ends: 128 [2024-11-21 20:41:22,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-21 20:41:22,350 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 41 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:41:22,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 79 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:41:22,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-21 20:41:22,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2024-11-21 20:41:22,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:22,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2024-11-21 20:41:22,361 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 120 [2024-11-21 20:41:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:41:22,361 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2024-11-21 20:41:22,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2024-11-21 20:41:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-21 20:41:22,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:41:22,362 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:41:22,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-21 20:41:22,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:41:22,563 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:41:22,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:41:22,564 INFO L85 PathProgramCache]: Analyzing trace with hash 958079302, now seen corresponding path program 1 times [2024-11-21 20:41:22,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:41:22,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652347753] [2024-11-21 20:41:22,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:41:22,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:41:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:41:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1435 trivial. 0 not checked. [2024-11-21 20:41:22,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:41:22,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652347753] [2024-11-21 20:41:22,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652347753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:41:22,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:41:22,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 20:41:22,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656466050] [2024-11-21 20:41:22,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:41:22,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 20:41:22,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:41:22,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 20:41:22,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 20:41:22,640 INFO L87 Difference]: Start difference. First operand 126 states and 130 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:22,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:41:22,645 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2024-11-21 20:41:22,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 20:41:22,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2024-11-21 20:41:22,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:41:22,646 INFO L225 Difference]: With dead ends: 133 [2024-11-21 20:41:22,646 INFO L226 Difference]: Without dead ends: 126 [2024-11-21 20:41:22,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 20:41:22,647 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:41:22,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:41:22,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-21 20:41:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-21 20:41:22,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.024) internal successors, (128), 125 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2024-11-21 20:41:22,661 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 123 [2024-11-21 20:41:22,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:41:22,661 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2024-11-21 20:41:22,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2024-11-21 20:41:22,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-21 20:41:22,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:41:22,666 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:41:22,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 20:41:22,666 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:41:22,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:41:22,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1507191824, now seen corresponding path program 1 times [2024-11-21 20:41:22,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:41:22,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727112021] [2024-11-21 20:41:22,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:41:22,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:41:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:41:23,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1438 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2024-11-21 20:41:23,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:41:23,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727112021] [2024-11-21 20:41:23,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727112021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:41:23,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881546453] [2024-11-21 20:41:23,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:41:23,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:41:23,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:41:23,133 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-21 20:41:23,134 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-21 20:41:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:41:23,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-21 20:41:23,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:41:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1438 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2024-11-21 20:41:23,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:41:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1438 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2024-11-21 20:41:23,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881546453] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:41:23,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:41:23,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2024-11-21 20:41:23,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803709090] [2024-11-21 20:41:23,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:41:23,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-21 20:41:23,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:41:23,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-21 20:41:23,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2024-11-21 20:41:23,783 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand has 35 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 35 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:23,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:41:23,843 INFO L93 Difference]: Finished difference Result 253 states and 268 transitions. [2024-11-21 20:41:23,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-21 20:41:23,843 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 35 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2024-11-21 20:41:23,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:41:23,844 INFO L225 Difference]: With dead ends: 253 [2024-11-21 20:41:23,844 INFO L226 Difference]: Without dead ends: 150 [2024-11-21 20:41:23,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2024-11-21 20:41:23,845 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:41:23,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 42 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:41:23,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-21 20:41:23,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-21 20:41:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.0201342281879195) internal successors, (152), 149 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:23,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2024-11-21 20:41:23,852 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 125 [2024-11-21 20:41:23,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:41:23,852 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2024-11-21 20:41:23,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 35 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:23,853 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2024-11-21 20:41:23,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-21 20:41:23,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:41:23,854 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 22, 22, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:41:23,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-21 20:41:24,054 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,SelfDestructingSolverStorable10 [2024-11-21 20:41:24,055 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:41:24,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:41:24,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1304041464, now seen corresponding path program 2 times [2024-11-21 20:41:24,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:41:24,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073791522] [2024-11-21 20:41:24,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:41:24,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:41:24,117 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:41:24,117 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:41:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1822 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2024-11-21 20:41:24,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:41:24,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073791522] [2024-11-21 20:41:24,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073791522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:41:24,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480906316] [2024-11-21 20:41:24,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:41:24,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:41:24,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:41:24,913 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 20:41:24,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-21 20:41:25,112 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:41:25,113 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:41:25,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-21 20:41:25,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:41:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1822 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2024-11-21 20:41:25,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:41:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1822 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2024-11-21 20:41:26,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480906316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:41:26,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:41:26,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 71 [2024-11-21 20:41:26,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799641119] [2024-11-21 20:41:26,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:41:26,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-21 20:41:26,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:41:26,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-21 20:41:26,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2024-11-21 20:41:26,845 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand has 71 states, 71 states have (on average 2.140845070422535) internal successors, (152), 71 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:41:26,972 INFO L93 Difference]: Finished difference Result 301 states and 328 transitions. [2024-11-21 20:41:26,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-21 20:41:26,973 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.140845070422535) internal successors, (152), 71 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2024-11-21 20:41:26,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:41:26,974 INFO L225 Difference]: With dead ends: 301 [2024-11-21 20:41:26,974 INFO L226 Difference]: Without dead ends: 198 [2024-11-21 20:41:26,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2024-11-21 20:41:26,976 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:41:26,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 68 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:41:26,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-21 20:41:26,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-21 20:41:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.015228426395939) internal successors, (200), 197 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:26,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 200 transitions. [2024-11-21 20:41:26,989 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 200 transitions. Word has length 149 [2024-11-21 20:41:26,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:41:26,990 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 200 transitions. [2024-11-21 20:41:26,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.140845070422535) internal successors, (152), 71 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 200 transitions. [2024-11-21 20:41:26,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-21 20:41:26,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:41:26,991 INFO L215 NwaCegarLoop]: trace histogram [46, 46, 30, 30, 30, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:41:27,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-21 20:41:27,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:41:27,196 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:41:27,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:41:27,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1949775928, now seen corresponding path program 3 times [2024-11-21 20:41:27,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:41:27,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903446745] [2024-11-21 20:41:27,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 20:41:27,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:41:27,245 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-21 20:41:27,245 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:41:27,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 3246 trivial. 0 not checked. [2024-11-21 20:41:27,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:41:27,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903446745] [2024-11-21 20:41:27,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903446745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:41:27,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683275240] [2024-11-21 20:41:27,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 20:41:27,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:41:27,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:41:27,468 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 20:41:27,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-21 20:41:27,670 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-21 20:41:27,670 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:41:27,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-21 20:41:27,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:41:28,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-21 20:41:28,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:41:28,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2024-11-21 20:41:28,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 0 proven. 179 refuted. 0 times theorem prover too weak. 3275 trivial. 0 not checked. [2024-11-21 20:41:28,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:41:28,491 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 44 treesize of output 38 [2024-11-21 20:41:28,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 0 proven. 179 refuted. 0 times theorem prover too weak. 3275 trivial. 0 not checked. [2024-11-21 20:41:28,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683275240] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:41:28,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:41:28,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2024-11-21 20:41:28,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454885023] [2024-11-21 20:41:28,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:41:28,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-21 20:41:28,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:41:28,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-21 20:41:28,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2024-11-21 20:41:28,780 INFO L87 Difference]: Start difference. First operand 198 states and 200 transitions. Second operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:32,789 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-21 20:41:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:41:32,926 INFO L93 Difference]: Finished difference Result 198 states and 200 transitions. [2024-11-21 20:41:32,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 20:41:32,927 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 197 [2024-11-21 20:41:32,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:41:32,927 INFO L225 Difference]: With dead ends: 198 [2024-11-21 20:41:32,927 INFO L226 Difference]: Without dead ends: 0 [2024-11-21 20:41:32,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 382 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2024-11-21 20:41:32,931 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:41:32,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 22 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2024-11-21 20:41:32,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-21 20:41:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-21 20:41:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-21 20:41:32,933 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 197 [2024-11-21 20:41:32,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:41:32,933 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-21 20:41:32,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 20:41:32,933 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-21 20:41:32,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-21 20:41:32,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 20:41:32,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-21 20:41:33,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-21 20:41:33,139 INFO L407 BasicCegarLoop]: Path program histogram: [6, 3, 1, 1, 1, 1] [2024-11-21 20:41:33,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-21 20:41:33,618 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 20:41:33,628 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~flag~0 [2024-11-21 20:41:33,629 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#a~0!offset [2024-11-21 20:41:33,629 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!offset [2024-11-21 20:41:33,629 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!base [2024-11-21 20:41:33,629 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#a~0!base [2024-11-21 20:41:33,629 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-21 20:41:33,629 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~flag~0 [2024-11-21 20:41:33,629 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#a~0!offset [2024-11-21 20:41:33,630 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!offset [2024-11-21 20:41:33,630 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!base [2024-11-21 20:41:33,630 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#a~0!base [2024-11-21 20:41:33,632 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-21 20:41:33,632 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-21 20:41:33,632 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#a~0!base,]]] [2024-11-21 20:41:33,632 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-21 20:41:33,632 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-21 20:41:33,632 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#a~0!base,]]] [2024-11-21 20:41:33,632 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-21 20:41:33,632 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-21 20:41:33,633 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#a~0!base,]]] [2024-11-21 20:41:33,633 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#a~0!offset [2024-11-21 20:41:33,633 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-21 20:41:33,633 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-21 20:41:33,633 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#a~0!base,]]] [2024-11-21 20:41:33,633 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#a~0!offset [2024-11-21 20:41:33,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 08:41:33 BoogieIcfgContainer [2024-11-21 20:41:33,634 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 20:41:33,634 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 20:41:33,635 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 20:41:33,635 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 20:41:33,635 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:41:12" (3/4) ... [2024-11-21 20:41:33,637 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-21 20:41:33,642 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-21 20:41:33,642 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-21 20:41:33,642 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-21 20:41:33,642 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-21 20:41:33,708 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 20:41:33,708 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-21 20:41:33,709 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 20:41:33,709 INFO L158 Benchmark]: Toolchain (without parser) took 21966.97ms. Allocated memory was 188.7MB in the beginning and 339.7MB in the end (delta: 151.0MB). Free memory was 121.4MB in the beginning and 156.4MB in the end (delta: -35.0MB). Peak memory consumption was 116.5MB. Max. memory is 16.1GB. [2024-11-21 20:41:33,709 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 20:41:33,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.46ms. Allocated memory is still 188.7MB. Free memory was 121.3MB in the beginning and 108.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 20:41:33,710 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.47ms. Allocated memory is still 188.7MB. Free memory was 108.5MB in the beginning and 106.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 20:41:33,710 INFO L158 Benchmark]: Boogie Preprocessor took 44.10ms. Allocated memory is still 188.7MB. Free memory was 106.9MB in the beginning and 160.8MB in the end (delta: -53.9MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2024-11-21 20:41:33,710 INFO L158 Benchmark]: RCFGBuilder took 307.32ms. Allocated memory is still 188.7MB. Free memory was 160.8MB in the beginning and 148.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 20:41:33,711 INFO L158 Benchmark]: TraceAbstraction took 21323.88ms. Allocated memory was 188.7MB in the beginning and 339.7MB in the end (delta: 151.0MB). Free memory was 147.5MB in the beginning and 160.6MB in the end (delta: -13.1MB). Peak memory consumption was 189.6MB. Max. memory is 16.1GB. [2024-11-21 20:41:33,712 INFO L158 Benchmark]: Witness Printer took 74.30ms. Allocated memory is still 339.7MB. Free memory was 160.6MB in the beginning and 156.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-21 20:41:33,712 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.46ms. Allocated memory is still 188.7MB. Free memory was 121.3MB in the beginning and 108.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.47ms. Allocated memory is still 188.7MB. Free memory was 108.5MB in the beginning and 106.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.10ms. Allocated memory is still 188.7MB. Free memory was 106.9MB in the beginning and 160.8MB in the end (delta: -53.9MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * RCFGBuilder took 307.32ms. Allocated memory is still 188.7MB. Free memory was 160.8MB in the beginning and 148.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 21323.88ms. Allocated memory was 188.7MB in the beginning and 339.7MB in the end (delta: 151.0MB). Free memory was 147.5MB in the beginning and 160.6MB in the end (delta: -13.1MB). Peak memory consumption was 189.6MB. Max. memory is 16.1GB. * Witness Printer took 74.30ms. Allocated memory is still 339.7MB. Free memory was 160.6MB in the beginning and 156.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~flag~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#a~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~flag~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#a~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#a~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 15]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.8s, OverallIterations: 13, TraceHistogramMax: 46, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 907 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 907 mSDsluCounter, 808 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 612 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 704 IncrementalHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 196 mSDtfsCounter, 704 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1688 GetRequests, 1467 SyntacticMatches, 2 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=12, InterpolantAutomatonStates: 177, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 360 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 1747 NumberOfCodeBlocks, 1183 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 2501 ConstructedInterpolants, 1 QuantifiedInterpolants, 14787 SizeOfPredicates, 17 NumberOfNonLiveVariables, 3306 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 32 InterpolantComputations, 4 PerfectInterpolantSequences, 24340/27887 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((size == 100000) || ((size == 100000) && (i == 0))) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: (1 <= flag) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((0 < flag) || ((i <= 99999) && (flag == 0))) || ((i == 0) && (flag == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-21 20:41:33,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE