/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/loops/invert_string-3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:46:00,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:46:00,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 04:46:00,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:46:00,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:46:00,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:46:00,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:46:00,853 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:46:00,854 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:46:00,856 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:46:00,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:46:00,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:46:00,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:46:00,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:46:00,858 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:46:00,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:46:00,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:46:00,859 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:46:00,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:46:00,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:46:00,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:46:00,872 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:46:00,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:46:00,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:46:00,872 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:46:00,873 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:46:00,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:46:00,873 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:46:00,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:46:00,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:46:00,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:46:00,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:46:00,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:46:00,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:46:00,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:46:00,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:46:00,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:46:00,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:46:00,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:46:00,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:46:00,875 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:46:00,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:46:00,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:46:00,876 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: Use bitabs translation -> false [2023-12-16 04:46:01,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:46:01,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:46:01,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:46:01,241 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:46:01,248 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:46:01,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-3.c [2023-12-16 04:46:02,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:46:02,807 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:46:02,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c [2023-12-16 04:46:02,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b800c6b0/d401d53a8b21444aaf28db53a22a69a1/FLAGb5b2ecf1e [2023-12-16 04:46:02,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b800c6b0/d401d53a8b21444aaf28db53a22a69a1 [2023-12-16 04:46:02,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:46:02,828 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:46:02,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:46:02,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:46:02,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:46:02,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:46:02" (1/1) ... [2023-12-16 04:46:02,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a61487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:02, skipping insertion in model container [2023-12-16 04:46:02,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:46:02" (1/1) ... [2023-12-16 04:46:02,845 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:46:02,933 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c[327,340] [2023-12-16 04:46:02,946 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:46:02,951 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:46:02,958 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c[327,340] [2023-12-16 04:46:02,964 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:46:02,975 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:46:02,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:02 WrapperNode [2023-12-16 04:46:02,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:46:02,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:46:02,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:46:02,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:46:02,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:02" (1/1) ... [2023-12-16 04:46:02,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:02" (1/1) ... [2023-12-16 04:46:02,997 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2023-12-16 04:46:02,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:46:02,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:46:02,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:46:02,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:46:03,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:02" (1/1) ... [2023-12-16 04:46:03,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:02" (1/1) ... [2023-12-16 04:46:03,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:02" (1/1) ... [2023-12-16 04:46:03,018 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 2, 4]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2023-12-16 04:46:03,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:02" (1/1) ... [2023-12-16 04:46:03,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:02" (1/1) ... [2023-12-16 04:46:03,022 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:02" (1/1) ... [2023-12-16 04:46:03,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:02" (1/1) ... [2023-12-16 04:46:03,024 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:02" (1/1) ... [2023-12-16 04:46:03,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:02" (1/1) ... [2023-12-16 04:46:03,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:46:03,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:46:03,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:46:03,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:46:03,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:02" (1/1) ... [2023-12-16 04:46:03,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:46:03,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:46:03,064 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) [2023-12-16 04:46:03,089 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 [2023-12-16 04:46:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:46:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:46:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:46:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:46:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 04:46:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:46:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:46:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 04:46:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:46:03,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:46:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:46:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:46:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 04:46:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 04:46:03,169 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:46:03,170 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:46:03,345 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:46:03,386 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:46:03,387 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-16 04:46:03,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:46:03 BoogieIcfgContainer [2023-12-16 04:46:03,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:46:03,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:46:03,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:46:03,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:46:03,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:46:02" (1/3) ... [2023-12-16 04:46:03,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e8699e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:46:03, skipping insertion in model container [2023-12-16 04:46:03,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:02" (2/3) ... [2023-12-16 04:46:03,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e8699e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:46:03, skipping insertion in model container [2023-12-16 04:46:03,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:46:03" (3/3) ... [2023-12-16 04:46:03,406 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string-3.c [2023-12-16 04:46:03,417 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:46:03,417 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:46:03,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:46:03,460 INFO L357 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, mHoare=true, 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;@70fc7c46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:46:03,460 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:46:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.8) internal successors, (18), 11 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) [2023-12-16 04:46:03,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-16 04:46:03,466 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:46:03,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:46:03,467 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:46:03,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:46:03,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1223517790, now seen corresponding path program 1 times [2023-12-16 04:46:03,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:46:03,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741344252] [2023-12-16 04:46:03,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:46:03,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:46:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:46:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:46:04,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:46:04,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741344252] [2023-12-16 04:46:04,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741344252] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:46:04,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:46:04,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:46:04,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165580525] [2023-12-16 04:46:04,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:46:04,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:46:04,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:46:04,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:46:04,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:46:04,134 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.8) internal successors, (18), 11 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) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2023-12-16 04:46:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:46:04,212 INFO L93 Difference]: Finished difference Result 23 states and 35 transitions. [2023-12-16 04:46:04,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:46:04,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2023-12-16 04:46:04,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:46:04,219 INFO L225 Difference]: With dead ends: 23 [2023-12-16 04:46:04,219 INFO L226 Difference]: Without dead ends: 11 [2023-12-16 04:46:04,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:46:04,225 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:46:04,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 7 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:46:04,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-16 04:46:04,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-16 04:46:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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) [2023-12-16 04:46:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-12-16 04:46:04,247 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2023-12-16 04:46:04,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:46:04,247 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-12-16 04:46:04,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2023-12-16 04:46:04,247 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-12-16 04:46:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 04:46:04,248 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:46:04,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:46:04,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:46:04,248 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:46:04,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:46:04,249 INFO L85 PathProgramCache]: Analyzing trace with hash 440511619, now seen corresponding path program 1 times [2023-12-16 04:46:04,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:46:04,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497612889] [2023-12-16 04:46:04,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:46:04,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:46:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:46:04,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:46:04,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:46:04,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497612889] [2023-12-16 04:46:04,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497612889] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:46:04,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:46:04,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:46:04,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521195997] [2023-12-16 04:46:04,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:46:04,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:46:04,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:46:04,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:46:04,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:46:04,366 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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) [2023-12-16 04:46:04,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:46:04,389 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2023-12-16 04:46:04,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:46:04,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2023-12-16 04:46:04,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:46:04,390 INFO L225 Difference]: With dead ends: 21 [2023-12-16 04:46:04,390 INFO L226 Difference]: Without dead ends: 12 [2023-12-16 04:46:04,391 INFO L412 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 [2023-12-16 04:46:04,392 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:46:04,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:46:04,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-16 04:46:04,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-12-16 04:46:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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) [2023-12-16 04:46:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-12-16 04:46:04,400 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2023-12-16 04:46:04,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:46:04,400 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-12-16 04:46:04,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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) [2023-12-16 04:46:04,401 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-12-16 04:46:04,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 04:46:04,401 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:46:04,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:46:04,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:46:04,401 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:46:04,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:46:04,403 INFO L85 PathProgramCache]: Analyzing trace with hash -316658865, now seen corresponding path program 1 times [2023-12-16 04:46:04,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:46:04,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423804472] [2023-12-16 04:46:04,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:46:04,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:46:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:46:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:46:04,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:46:04,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423804472] [2023-12-16 04:46:04,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423804472] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:46:04,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810334007] [2023-12-16 04:46:04,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:46:04,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:46:04,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:46:04,542 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) [2023-12-16 04:46:04,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 04:46:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:46:04,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-16 04:46:04,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:46:04,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 56 treesize of output 43 [2023-12-16 04:46:04,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2023-12-16 04:46:04,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-16 04:46:04,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:46:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:46:04,970 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:46:05,080 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 27 treesize of output 25 [2023-12-16 04:46:05,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 37 treesize of output 28 [2023-12-16 04:46:05,090 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 26 treesize of output 24 [2023-12-16 04:46:05,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 24 [2023-12-16 04:46:05,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:46:05,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810334007] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:46:05,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:46:05,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 15 [2023-12-16 04:46:05,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297792589] [2023-12-16 04:46:05,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:46:05,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 04:46:05,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:46:05,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 04:46:05,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:46:05,120 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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) [2023-12-16 04:46:05,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:46:05,842 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2023-12-16 04:46:05,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 04:46:05,843 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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 10 [2023-12-16 04:46:05,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:46:05,843 INFO L225 Difference]: With dead ends: 52 [2023-12-16 04:46:05,844 INFO L226 Difference]: Without dead ends: 43 [2023-12-16 04:46:05,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=264, Invalid=858, Unknown=0, NotChecked=0, Total=1122 [2023-12-16 04:46:05,846 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 88 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:46:05,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 39 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:46:05,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-16 04:46:05,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 18. [2023-12-16 04:46:05,859 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) [2023-12-16 04:46:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-12-16 04:46:05,860 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-12-16 04:46:05,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:46:05,860 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-12-16 04:46:05,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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) [2023-12-16 04:46:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-12-16 04:46:05,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 04:46:05,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:46:05,861 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:46:05,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 04:46:06,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:46:06,066 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:46:06,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:46:06,067 INFO L85 PathProgramCache]: Analyzing trace with hash -401541789, now seen corresponding path program 2 times [2023-12-16 04:46:06,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:46:06,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11507726] [2023-12-16 04:46:06,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:46:06,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:46:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:46:06,289 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 04:46:06,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:46:06,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11507726] [2023-12-16 04:46:06,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11507726] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:46:06,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572666080] [2023-12-16 04:46:06,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 04:46:06,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:46:06,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:46:06,290 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) [2023-12-16 04:46:06,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 04:46:06,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 04:46:06,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:46:06,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-16 04:46:06,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:46:06,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-16 04:46:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:46:06,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:46:06,743 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 26 treesize of output 18 [2023-12-16 04:46:06,747 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 18 treesize of output 16 [2023-12-16 04:46:06,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 20 [2023-12-16 04:46:06,761 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 27 treesize of output 19 [2023-12-16 04:46:06,764 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 19 treesize of output 17 [2023-12-16 04:46:06,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 24 [2023-12-16 04:46:06,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 04:46:06,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572666080] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:46:06,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:46:06,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 23 [2023-12-16 04:46:06,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113152302] [2023-12-16 04:46:06,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:46:06,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-16 04:46:06,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:46:06,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-16 04:46:06,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2023-12-16 04:46:06,873 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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) [2023-12-16 04:46:08,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:46:08,496 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2023-12-16 04:46:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-16 04:46:08,497 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 13 [2023-12-16 04:46:08,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:46:08,497 INFO L225 Difference]: With dead ends: 64 [2023-12-16 04:46:08,497 INFO L226 Difference]: Without dead ends: 55 [2023-12-16 04:46:08,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=570, Invalid=2082, Unknown=0, NotChecked=0, Total=2652 [2023-12-16 04:46:08,498 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 125 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:46:08,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 139 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:46:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-16 04:46:08,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 22. [2023-12-16 04:46:08,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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) [2023-12-16 04:46:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2023-12-16 04:46:08,505 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2023-12-16 04:46:08,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:46:08,506 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-12-16 04:46:08,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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) [2023-12-16 04:46:08,506 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2023-12-16 04:46:08,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 04:46:08,506 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:46:08,506 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:46:08,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 04:46:08,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-16 04:46:08,711 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:46:08,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:46:08,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1243371330, now seen corresponding path program 1 times [2023-12-16 04:46:08,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:46:08,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644623727] [2023-12-16 04:46:08,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:46:08,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:46:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:46:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-16 04:46:08,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:46:08,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644623727] [2023-12-16 04:46:08,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644623727] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:46:08,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424181149] [2023-12-16 04:46:08,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:46:08,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:46:08,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:46:08,940 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) [2023-12-16 04:46:08,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 04:46:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:46:08,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-16 04:46:08,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:46:09,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-16 04:46:09,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:46:09,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2023-12-16 04:46:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:46:09,663 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:46:09,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:46:09,897 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 97 treesize of output 65 [2023-12-16 04:46:09,901 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 65 treesize of output 61 [2023-12-16 04:46:09,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:46:09,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 286 treesize of output 259 [2023-12-16 04:46:10,116 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 04:46:10,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424181149] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:46:10,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:46:10,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 11] total 28 [2023-12-16 04:46:10,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462050494] [2023-12-16 04:46:10,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:46:10,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-16 04:46:10,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:46:10,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-16 04:46:10,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2023-12-16 04:46:10,118 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 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) [2023-12-16 04:46:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:46:12,540 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2023-12-16 04:46:12,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-16 04:46:12,541 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 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 17 [2023-12-16 04:46:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:46:12,541 INFO L225 Difference]: With dead ends: 79 [2023-12-16 04:46:12,541 INFO L226 Difference]: Without dead ends: 71 [2023-12-16 04:46:12,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=586, Invalid=2954, Unknown=0, NotChecked=0, Total=3540 [2023-12-16 04:46:12,543 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 327 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:46:12,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 195 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:46:12,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-16 04:46:12,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 29. [2023-12-16 04:46:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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) [2023-12-16 04:46:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-12-16 04:46:12,553 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 17 [2023-12-16 04:46:12,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:46:12,553 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-12-16 04:46:12,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 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) [2023-12-16 04:46:12,553 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-12-16 04:46:12,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 04:46:12,553 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:46:12,553 INFO L195 NwaCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:46:12,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 04:46:12,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:46:12,763 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:46:12,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:46:12,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1407896611, now seen corresponding path program 3 times [2023-12-16 04:46:12,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:46:12,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959764369] [2023-12-16 04:46:12,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:46:12,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:46:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:46:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 04:46:12,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:46:12,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959764369] [2023-12-16 04:46:12,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959764369] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:46:12,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671692432] [2023-12-16 04:46:12,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 04:46:12,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:46:12,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:46:12,952 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) [2023-12-16 04:46:12,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 04:46:13,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 04:46:13,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:46:13,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 04:46:13,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:46:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 04:46:13,061 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:46:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 04:46:13,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671692432] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:46:13,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:46:13,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 5] total 16 [2023-12-16 04:46:13,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864997980] [2023-12-16 04:46:13,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:46:13,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-16 04:46:13,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:46:13,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-16 04:46:13,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2023-12-16 04:46:13,261 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 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) [2023-12-16 04:46:13,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:46:13,896 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2023-12-16 04:46:13,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 04:46:13,897 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 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 17 [2023-12-16 04:46:13,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:46:13,897 INFO L225 Difference]: With dead ends: 61 [2023-12-16 04:46:13,897 INFO L226 Difference]: Without dead ends: 36 [2023-12-16 04:46:13,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2023-12-16 04:46:13,898 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 62 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:46:13,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 27 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:46:13,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-16 04:46:13,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2023-12-16 04:46:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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) [2023-12-16 04:46:13,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2023-12-16 04:46:13,907 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 17 [2023-12-16 04:46:13,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:46:13,908 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2023-12-16 04:46:13,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 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) [2023-12-16 04:46:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2023-12-16 04:46:13,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 04:46:13,914 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:46:13,914 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:46:13,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-16 04:46:14,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:46:14,120 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:46:14,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:46:14,121 INFO L85 PathProgramCache]: Analyzing trace with hash -40076209, now seen corresponding path program 2 times [2023-12-16 04:46:14,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:46:14,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862015283] [2023-12-16 04:46:14,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:46:14,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:46:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:46:14,853 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 04:46:14,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:46:14,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862015283] [2023-12-16 04:46:14,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862015283] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:46:14,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885567146] [2023-12-16 04:46:14,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 04:46:14,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:46:14,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:46:14,854 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) [2023-12-16 04:46:14,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 04:46:14,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 04:46:14,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:46:14,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-16 04:46:14,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:46:15,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-16 04:46:15,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-12-16 04:46:15,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:46:15,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2023-12-16 04:46:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 04:46:15,509 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:46:15,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:46:15,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 31 [2023-12-16 04:46:15,756 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 31 treesize of output 29 [2023-12-16 04:46:15,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1618 treesize of output 1546 [2023-12-16 04:46:15,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:46:15,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 31 [2023-12-16 04:46:15,784 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 31 treesize of output 29 [2023-12-16 04:46:15,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1618 treesize of output 1546 [2023-12-16 04:46:15,914 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 04:46:15,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885567146] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:46:15,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:46:15,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 34 [2023-12-16 04:46:15,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339314688] [2023-12-16 04:46:15,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:46:15,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-16 04:46:15,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:46:15,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-16 04:46:15,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2023-12-16 04:46:15,916 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 34 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 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) [2023-12-16 04:46:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:46:17,849 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2023-12-16 04:46:17,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-16 04:46:17,849 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 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 24 [2023-12-16 04:46:17,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:46:17,850 INFO L225 Difference]: With dead ends: 56 [2023-12-16 04:46:17,850 INFO L226 Difference]: Without dead ends: 54 [2023-12-16 04:46:17,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=709, Invalid=2831, Unknown=0, NotChecked=0, Total=3540 [2023-12-16 04:46:17,851 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 190 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:46:17,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 82 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:46:17,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-16 04:46:17,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 28. [2023-12-16 04:46:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 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) [2023-12-16 04:46:17,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2023-12-16 04:46:17,866 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2023-12-16 04:46:17,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:46:17,867 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2023-12-16 04:46:17,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 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) [2023-12-16 04:46:17,867 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2023-12-16 04:46:17,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 04:46:17,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:46:17,868 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:46:17,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-16 04:46:18,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:46:18,075 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:46:18,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:46:18,075 INFO L85 PathProgramCache]: Analyzing trace with hash 95727853, now seen corresponding path program 3 times [2023-12-16 04:46:18,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:46:18,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42937834] [2023-12-16 04:46:18,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:46:18,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:46:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:46:19,312 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 04:46:19,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:46:19,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42937834] [2023-12-16 04:46:19,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42937834] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:46:19,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186462804] [2023-12-16 04:46:19,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 04:46:19,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:46:19,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:46:19,315 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) [2023-12-16 04:46:19,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-16 04:46:19,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-16 04:46:19,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:46:19,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 75 conjunts are in the unsatisfiable core [2023-12-16 04:46:19,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:46:19,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 04:46:19,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 56 treesize of output 43 [2023-12-16 04:46:19,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-16 04:46:19,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2023-12-16 04:46:19,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-16 04:46:20,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-12-16 04:46:20,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:46:20,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2023-12-16 04:46:20,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:46:20,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 60 [2023-12-16 04:46:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:46:20,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:46:21,003 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 65 treesize of output 63 [2023-12-16 04:46:21,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4482 treesize of output 4410 [2023-12-16 04:46:21,035 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 65 treesize of output 63 [2023-12-16 04:46:21,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1104 treesize of output 1086 [2023-12-16 04:46:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 04:46:21,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186462804] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:46:21,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:46:21,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 14] total 43 [2023-12-16 04:46:21,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120664902] [2023-12-16 04:46:21,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:46:21,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-16 04:46:21,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:46:21,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-16 04:46:21,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1509, Unknown=0, NotChecked=0, Total=1806 [2023-12-16 04:46:21,313 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 43 states have internal predecessors, (69), 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) [2023-12-16 04:46:23,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:46:23,621 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2023-12-16 04:46:23,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-16 04:46:23,621 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 43 states have internal predecessors, (69), 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 27 [2023-12-16 04:46:23,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:46:23,621 INFO L225 Difference]: With dead ends: 53 [2023-12-16 04:46:23,621 INFO L226 Difference]: Without dead ends: 51 [2023-12-16 04:46:23,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=868, Invalid=3688, Unknown=0, NotChecked=0, Total=4556 [2023-12-16 04:46:23,623 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 204 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:46:23,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 74 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 04:46:23,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-16 04:46:23,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2023-12-16 04:46:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 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) [2023-12-16 04:46:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2023-12-16 04:46:23,639 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2023-12-16 04:46:23,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:46:23,639 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2023-12-16 04:46:23,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 43 states have internal predecessors, (69), 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) [2023-12-16 04:46:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2023-12-16 04:46:23,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-16 04:46:23,639 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:46:23,639 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:46:23,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-16 04:46:23,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:46:23,845 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:46:23,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:46:23,846 INFO L85 PathProgramCache]: Analyzing trace with hash -24653937, now seen corresponding path program 4 times [2023-12-16 04:46:23,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:46:23,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913869585] [2023-12-16 04:46:23,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:46:23,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:46:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:46:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:46:25,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:46:25,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913869585] [2023-12-16 04:46:25,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913869585] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:46:25,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433905777] [2023-12-16 04:46:25,358 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 04:46:25,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:46:25,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:46:25,359 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) [2023-12-16 04:46:25,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-16 04:46:25,424 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 04:46:25,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:46:25,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 76 conjunts are in the unsatisfiable core [2023-12-16 04:46:25,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:46:25,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-16 04:46:25,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-12-16 04:46:25,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:46:25,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2023-12-16 04:46:25,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:46:25,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 62 [2023-12-16 04:46:25,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:46:25,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:46:25,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:46:25,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:46:25,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:46:25,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 76 [2023-12-16 04:46:26,643 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:46:26,643 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:46:27,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:46:27,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 42 [2023-12-16 04:46:27,202 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 42 treesize of output 40 [2023-12-16 04:46:27,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6418 treesize of output 6346 [2023-12-16 04:46:27,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:46:27,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 42 [2023-12-16 04:46:27,270 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 42 treesize of output 40 [2023-12-16 04:46:27,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6418 treesize of output 6346 [2023-12-16 04:46:27,364 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 04:46:27,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433905777] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:46:27,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:46:27,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 15] total 51 [2023-12-16 04:46:27,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422178023] [2023-12-16 04:46:27,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:46:27,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-16 04:46:27,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:46:27,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-16 04:46:27,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2242, Unknown=0, NotChecked=0, Total=2550 [2023-12-16 04:46:27,366 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 51 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 51 states have internal predecessors, (83), 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) [2023-12-16 04:46:29,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:46:29,877 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2023-12-16 04:46:29,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-16 04:46:29,878 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 51 states have internal predecessors, (83), 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 30 [2023-12-16 04:46:29,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:46:29,878 INFO L225 Difference]: With dead ends: 43 [2023-12-16 04:46:29,878 INFO L226 Difference]: Without dead ends: 41 [2023-12-16 04:46:29,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1502 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=909, Invalid=5253, Unknown=0, NotChecked=0, Total=6162 [2023-12-16 04:46:29,880 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 160 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:46:29,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 78 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 04:46:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-16 04:46:29,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2023-12-16 04:46:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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) [2023-12-16 04:46:29,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2023-12-16 04:46:29,897 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2023-12-16 04:46:29,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:46:29,897 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2023-12-16 04:46:29,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 51 states have internal predecessors, (83), 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) [2023-12-16 04:46:29,897 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2023-12-16 04:46:29,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 04:46:29,898 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:46:29,898 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:46:29,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-16 04:46:30,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:46:30,099 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:46:30,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:46:30,099 INFO L85 PathProgramCache]: Analyzing trace with hash -20867667, now seen corresponding path program 5 times [2023-12-16 04:46:30,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:46:30,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742616197] [2023-12-16 04:46:30,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:46:30,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:46:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:46:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 04:46:30,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:46:30,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742616197] [2023-12-16 04:46:30,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742616197] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:46:30,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301563424] [2023-12-16 04:46:30,287 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 04:46:30,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:46:30,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:46:30,288 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) [2023-12-16 04:46:30,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-16 04:46:30,566 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-16 04:46:30,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:46:30,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-16 04:46:30,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:46:30,733 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 04:46:30,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:46:30,868 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 04:46:30,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301563424] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:46:30,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:46:30,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2023-12-16 04:46:30,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433843160] [2023-12-16 04:46:30,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:46:30,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-16 04:46:30,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:46:30,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-16 04:46:30,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2023-12-16 04:46:30,870 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 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) [2023-12-16 04:46:31,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:46:31,016 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2023-12-16 04:46:31,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:46:31,040 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 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 33 [2023-12-16 04:46:31,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:46:31,041 INFO L225 Difference]: With dead ends: 59 [2023-12-16 04:46:31,041 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 04:46:31,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2023-12-16 04:46:31,041 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:46:31,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 46 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:46:31,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 04:46:31,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 04:46:31,042 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) [2023-12-16 04:46:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 04:46:31,042 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2023-12-16 04:46:31,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:46:31,042 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 04:46:31,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 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) [2023-12-16 04:46:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 04:46:31,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 04:46:31,044 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:46:31,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-16 04:46:31,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-16 04:46:31,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 04:46:32,030 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-12-16 04:46:32,030 INFO L895 garLoopResultBuilder]: At program point L32-3(lines 32 35) the Hoare annotation is: (let ((.cse10 (select |#memory_int#1| |ULTIMATE.start_main_~#str2~0#1.base|)) (.cse9 (select |#memory_int#2| |ULTIMATE.start_main_~#str1~0#1.base|))) (let ((.cse0 (= (select .cse10 1) (select .cse9 3))) (.cse1 (= 5 |ULTIMATE.start_main_~max~0#1|)) (.cse2 (= (select .cse10 0) 0)) (.cse3 (= |ULTIMATE.start_main_~#str2~0#1.offset| 0)) (.cse4 (= (select .cse10 2) (select .cse9 2))) (.cse5 (= (select .cse9 1) (select .cse10 3))) (.cse6 (= (select .cse9 4) 0)) (.cse7 (= (select .cse9 0) (select .cse10 4))) (.cse8 (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))) (or (and (= 2 |ULTIMATE.start_main_~j~0#1|) .cse0 .cse1 (= 2 |ULTIMATE.start_main_~i~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (= 3 |ULTIMATE.start_main_~i~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~j~0#1| 1) .cse8) (and (= |ULTIMATE.start_main_~j~0#1| 4) (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (= 5 |ULTIMATE.start_main_~i~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 1) .cse2 .cse3 (= 3 |ULTIMATE.start_main_~j~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 4) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_main_~j~0#1| 0) .cse7 .cse8)))) [2023-12-16 04:46:32,030 INFO L899 garLoopResultBuilder]: For program point L32-4(lines 32 35) no Hoare annotation was computed. [2023-12-16 04:46:32,030 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2023-12-16 04:46:32,030 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 04:46:32,030 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 04:46:32,030 INFO L895 garLoopResultBuilder]: At program point L26-3(lines 26 29) the Hoare annotation is: (let ((.cse13 (select |#memory_int#2| |ULTIMATE.start_main_~#str1~0#1.base|))) (let ((.cse10 (select .cse13 2)) (.cse11 (select .cse13 3)) (.cse12 (select .cse13 1)) (.cse9 (select |#memory_int#1| |ULTIMATE.start_main_~#str2~0#1.base|))) (let ((.cse5 (= .cse12 (select .cse9 3))) (.cse0 (= (select .cse9 1) .cse11)) (.cse2 (= (select .cse9 0) 0)) (.cse4 (= (select .cse9 2) .cse10)) (.cse1 (= 5 |ULTIMATE.start_main_~max~0#1|)) (.cse3 (= |ULTIMATE.start_main_~#str2~0#1.offset| 0)) (.cse6 (= (select .cse13 4) 0)) (.cse7 (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))) (or (and (= |ULTIMATE.start_main_~j~0#1| 4) (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse8 (select .cse13 0))) (and (= .cse8 (select .cse9 (+ (- 1) |ULTIMATE.start_main_~j~0#1|))) .cse0 (= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse10 (select .cse9 (+ (- 3) |ULTIMATE.start_main_~j~0#1|))) (= .cse8 (select .cse9 4)) .cse7 (= .cse11 (select .cse9 (+ |ULTIMATE.start_main_~j~0#1| (- 4)))) (= .cse12 (select .cse9 (+ (- 2) |ULTIMATE.start_main_~j~0#1|))))) (and (= 3 |ULTIMATE.start_main_~i~0#1|) .cse1 .cse2 .cse3 .cse6 (= |ULTIMATE.start_main_~j~0#1| 1) .cse7) (and (= 2 |ULTIMATE.start_main_~j~0#1|) .cse0 .cse1 (= 2 |ULTIMATE.start_main_~i~0#1|) .cse2 .cse3 .cse6 .cse7) (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 1) .cse2 .cse3 (= 3 |ULTIMATE.start_main_~j~0#1|) .cse4 .cse6 .cse7) (and (= |ULTIMATE.start_main_~i~0#1| 4) .cse1 .cse3 .cse6 (= |ULTIMATE.start_main_~j~0#1| 0) .cse7))))) [2023-12-16 04:46:32,031 INFO L899 garLoopResultBuilder]: For program point L26-4(lines 26 29) no Hoare annotation was computed. [2023-12-16 04:46:32,031 INFO L895 garLoopResultBuilder]: At program point L18-3(lines 18 20) the Hoare annotation is: (let ((.cse0 (= 5 |ULTIMATE.start_main_~max~0#1|)) (.cse1 (= |ULTIMATE.start_main_~#str2~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))) (or (and (= 3 |ULTIMATE.start_main_~i~0#1|) .cse0 .cse1 .cse2) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 1) .cse1 .cse2) (and (= |ULTIMATE.start_main_~i~0#1| 4) .cse0 .cse1 .cse2) (and (= 5 |ULTIMATE.start_main_~i~0#1|) .cse0 .cse1 .cse2) (and .cse0 (= 2 |ULTIMATE.start_main_~i~0#1|) .cse1 .cse2) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2))) [2023-12-16 04:46:32,031 INFO L899 garLoopResultBuilder]: For program point L18-4(lines 18 20) no Hoare annotation was computed. [2023-12-16 04:46:32,031 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2023-12-16 04:46:32,031 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2023-12-16 04:46:32,034 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1] [2023-12-16 04:46:32,036 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:46:32,049 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-16 04:46:32,050 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-16 04:46:32,050 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-16 04:46:32,050 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated [2023-12-16 04:46:32,050 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-16 04:46:32,050 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated [2023-12-16 04:46:32,050 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated [2023-12-16 04:46:32,050 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-16 04:46:32,050 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated [2023-12-16 04:46:32,050 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated [2023-12-16 04:46:32,050 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-16 04:46:32,050 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-16 04:46:32,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-16 04:46:32,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated [2023-12-16 04:46:32,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-16 04:46:32,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated [2023-12-16 04:46:32,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated [2023-12-16 04:46:32,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-16 04:46:32,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated [2023-12-16 04:46:32,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated [2023-12-16 04:46:32,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-16 04:46:32,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-16 04:46:32,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-16 04:46:32,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated [2023-12-16 04:46:32,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-16 04:46:32,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated [2023-12-16 04:46:32,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated [2023-12-16 04:46:32,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-16 04:46:32,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated [2023-12-16 04:46:32,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated [2023-12-16 04:46:32,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-16 04:46:32,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-16 04:46:32,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-16 04:46:32,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated [2023-12-16 04:46:32,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-16 04:46:32,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated [2023-12-16 04:46:32,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated [2023-12-16 04:46:32,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-16 04:46:32,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated [2023-12-16 04:46:32,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated [2023-12-16 04:46:32,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-16 04:46:32,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-16 04:46:32,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-16 04:46:32,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated [2023-12-16 04:46:32,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-16 04:46:32,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated [2023-12-16 04:46:32,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated [2023-12-16 04:46:32,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-16 04:46:32,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated [2023-12-16 04:46:32,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated [2023-12-16 04:46:32,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-16 04:46:32,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-16 04:46:32,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-16 04:46:32,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated [2023-12-16 04:46:32,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-16 04:46:32,054 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated [2023-12-16 04:46:32,054 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated [2023-12-16 04:46:32,054 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-16 04:46:32,054 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated [2023-12-16 04:46:32,054 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated [2023-12-16 04:46:32,057 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-16 04:46:32,057 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-16 04:46:32,057 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-16 04:46:32,057 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated [2023-12-16 04:46:32,057 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-16 04:46:32,057 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated [2023-12-16 04:46:32,057 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated [2023-12-16 04:46:32,057 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-16 04:46:32,057 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated [2023-12-16 04:46:32,057 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][-1 + ~j~0] could not be translated [2023-12-16 04:46:32,057 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-16 04:46:32,057 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-16 04:46:32,058 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-16 04:46:32,058 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated [2023-12-16 04:46:32,058 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-16 04:46:32,058 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated [2023-12-16 04:46:32,058 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated [2023-12-16 04:46:32,058 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-16 04:46:32,058 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-16 04:46:32,058 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][-3 + ~j~0] could not be translated [2023-12-16 04:46:32,058 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated [2023-12-16 04:46:32,058 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated [2023-12-16 04:46:32,058 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-16 04:46:32,058 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][~j~0 + -4] could not be translated [2023-12-16 04:46:32,058 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated [2023-12-16 04:46:32,058 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][-2 + ~j~0] could not be translated [2023-12-16 04:46:32,059 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-16 04:46:32,059 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-16 04:46:32,059 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-16 04:46:32,059 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-16 04:46:32,059 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-16 04:46:32,059 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-16 04:46:32,059 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-16 04:46:32,059 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-16 04:46:32,059 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-16 04:46:32,059 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated [2023-12-16 04:46:32,059 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-16 04:46:32,059 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-16 04:46:32,059 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-16 04:46:32,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:46:32 BoogieIcfgContainer [2023-12-16 04:46:32,060 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:46:32,060 INFO L158 Benchmark]: Toolchain (without parser) took 29232.55ms. Allocated memory was 224.4MB in the beginning and 389.0MB in the end (delta: 164.6MB). Free memory was 172.9MB in the beginning and 270.4MB in the end (delta: -97.5MB). Peak memory consumption was 214.5MB. Max. memory is 8.0GB. [2023-12-16 04:46:32,060 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 164.6MB. Free memory was 110.9MB in the beginning and 110.8MB in the end (delta: 92.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:46:32,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.25ms. Allocated memory is still 224.4MB. Free memory was 172.4MB in the beginning and 161.4MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 04:46:32,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.87ms. Allocated memory is still 224.4MB. Free memory was 161.4MB in the beginning and 159.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 04:46:32,061 INFO L158 Benchmark]: Boogie Preprocessor took 30.38ms. Allocated memory is still 224.4MB. Free memory was 159.8MB in the beginning and 157.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 04:46:32,061 INFO L158 Benchmark]: RCFGBuilder took 367.74ms. Allocated memory is still 224.4MB. Free memory was 157.7MB in the beginning and 144.6MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 04:46:32,061 INFO L158 Benchmark]: TraceAbstraction took 28661.04ms. Allocated memory was 224.4MB in the beginning and 389.0MB in the end (delta: 164.6MB). Free memory was 144.1MB in the beginning and 270.4MB in the end (delta: -126.3MB). Peak memory consumption was 186.1MB. Max. memory is 8.0GB. [2023-12-16 04:46:32,062 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.11ms. Allocated memory is still 164.6MB. Free memory was 110.9MB in the beginning and 110.8MB in the end (delta: 92.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 147.25ms. Allocated memory is still 224.4MB. Free memory was 172.4MB in the beginning and 161.4MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.87ms. Allocated memory is still 224.4MB. Free memory was 161.4MB in the beginning and 159.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.38ms. Allocated memory is still 224.4MB. Free memory was 159.8MB in the beginning and 157.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 367.74ms. Allocated memory is still 224.4MB. Free memory was 157.7MB in the beginning and 144.6MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 28661.04ms. Allocated memory was 224.4MB in the beginning and 389.0MB in the end (delta: 164.6MB). Free memory was 144.1MB in the beginning and 270.4MB in the end (delta: -126.3MB). Peak memory consumption was 186.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][-1 + ~j~0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][-3 + ~j~0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][~j~0 + -4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][-2 + ~j~0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated * 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: 7]: 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, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.6s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1171 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1171 mSDsluCounter, 698 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 637 mSDsCounter, 443 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2771 IncrementalHoareTripleChecker+Invalid, 3214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 443 mSolverCounterUnsat, 61 mSDtfsCounter, 2771 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 597 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 396 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5204 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=9, InterpolantAutomatonStates: 217, 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, 10 MinimizatonAttempts, 164 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 21 NumberOfFragments, 856 HoareAnnotationTreeSize, 3 FormulaSimplifications, 6102972 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 3 FormulaSimplificationsInter, 128 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 359 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 504 ConstructedInterpolants, 24 QuantifiedInterpolants, 11767 SizeOfPredicates, 105 NumberOfNonLiveVariables, 1307 ConjunctsInSsa, 352 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 292/796 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: 32]: Loop Invariant Derived loop invariant: ((((((((2 == j) && (5 == max)) && (2 == i)) || (((3 == i) && (5 == max)) && (j == 1))) || (((j == 4) && (i == 0)) && (5 == max))) || ((5 == i) && (5 == max))) || (((5 == max) && (i == 1)) && (3 == j))) || (((i == 4) && (5 == max)) && (j == 0))) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((((((3 == i) && (5 == max)) || ((5 == max) && (i == 1))) || ((i == 4) && (5 == max))) || ((5 == i) && (5 == max))) || ((5 == max) && (2 == i))) || ((i == 0) && (5 == max))) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((((((((j == 4) && (i == 0)) && (5 == max)) || (((i + 1) == 0) && (5 == max))) || (((3 == i) && (5 == max)) && (j == 1))) || (((2 == j) && (5 == max)) && (2 == i))) || (((5 == max) && (i == 1)) && (3 == j))) || (((i == 4) && (5 == max)) && (j == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-16 04:46:32,092 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...