/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/ldv-regression/ex3_forlist.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 03:11:08,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 03:11:09,047 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-21 03:11:09,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 03:11:09,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 03:11:09,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 03:11:09,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 03:11:09,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 03:11:09,084 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 03:11:09,088 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 03:11:09,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 03:11:09,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 03:11:09,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 03:11:09,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 03:11:09,091 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 03:11:09,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 03:11:09,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 03:11:09,092 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 03:11:09,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 03:11:09,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 03:11:09,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 03:11:09,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 03:11:09,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 03:11:09,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 03:11:09,093 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 03:11:09,094 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 03:11:09,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 03:11:09,094 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 03:11:09,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 03:11:09,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 03:11:09,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 03:11:09,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 03:11:09,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:11:09,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 03:11:09,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 03:11:09,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 03:11:09,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 03:11:09,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 03:11:09,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 03:11:09,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 03:11:09,098 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 03:11:09,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 03:11:09,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 03:11:09,099 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-21 03:11:09,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 03:11:09,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 03:11:09,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 03:11:09,391 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 03:11:09,392 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 03:11:09,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/ex3_forlist.i [2023-12-21 03:11:10,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 03:11:10,706 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 03:11:10,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/ex3_forlist.i [2023-12-21 03:11:10,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e786a6af/93333ddc1bec49e9a39191306defa14d/FLAG058ab28c8 [2023-12-21 03:11:11,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e786a6af/93333ddc1bec49e9a39191306defa14d [2023-12-21 03:11:11,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 03:11:11,103 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 03:11:11,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 03:11:11,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 03:11:11,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 03:11:11,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:11:11" (1/1) ... [2023-12-21 03:11:11,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24602e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:11:11, skipping insertion in model container [2023-12-21 03:11:11,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:11:11" (1/1) ... [2023-12-21 03:11:11,129 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 03:11:11,232 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/ex3_forlist.i[293,306] [2023-12-21 03:11:11,254 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:11:11,263 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 03:11:11,274 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/ex3_forlist.i[293,306] [2023-12-21 03:11:11,285 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:11:11,299 INFO L206 MainTranslator]: Completed translation [2023-12-21 03:11:11,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:11:11 WrapperNode [2023-12-21 03:11:11,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 03:11:11,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 03:11:11,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 03:11:11,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 03:11:11,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:11:11" (1/1) ... [2023-12-21 03:11:11,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:11:11" (1/1) ... [2023-12-21 03:11:11,340 INFO L138 Inliner]: procedures = 19, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2023-12-21 03:11:11,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 03:11:11,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 03:11:11,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 03:11:11,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 03:11:11,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:11:11" (1/1) ... [2023-12-21 03:11:11,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:11:11" (1/1) ... [2023-12-21 03:11:11,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:11:11" (1/1) ... [2023-12-21 03:11:11,381 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 6, 6, 0]. 43 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 2, 0]. The 5 writes are split as follows [0, 2, 3, 0]. [2023-12-21 03:11:11,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:11:11" (1/1) ... [2023-12-21 03:11:11,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:11:11" (1/1) ... [2023-12-21 03:11:11,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:11:11" (1/1) ... [2023-12-21 03:11:11,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:11:11" (1/1) ... [2023-12-21 03:11:11,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:11:11" (1/1) ... [2023-12-21 03:11:11,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:11:11" (1/1) ... [2023-12-21 03:11:11,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 03:11:11,415 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 03:11:11,415 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 03:11:11,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 03:11:11,416 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:11:11" (1/1) ... [2023-12-21 03:11:11,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:11:11,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:11:11,460 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-21 03:11:11,490 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-21 03:11:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-21 03:11:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-21 03:11:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-21 03:11:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-21 03:11:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-21 03:11:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-21 03:11:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-21 03:11:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-12-21 03:11:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 03:11:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-12-21 03:11:11,499 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-12-21 03:11:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure g [2023-12-21 03:11:11,499 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2023-12-21 03:11:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 03:11:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 03:11:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 03:11:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 03:11:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure fake_malloc [2023-12-21 03:11:11,500 INFO L138 BoogieDeclarations]: Found implementation of procedure fake_malloc [2023-12-21 03:11:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-21 03:11:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-21 03:11:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-21 03:11:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-21 03:11:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 03:11:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 03:11:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 03:11:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 03:11:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 03:11:11,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 03:11:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 03:11:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 03:11:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 03:11:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 03:11:11,589 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 03:11:11,590 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 03:11:11,758 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 03:11:11,793 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 03:11:11,793 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 03:11:11,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:11:11 BoogieIcfgContainer [2023-12-21 03:11:11,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 03:11:11,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 03:11:11,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 03:11:11,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 03:11:11,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:11:11" (1/3) ... [2023-12-21 03:11:11,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775f6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:11:11, skipping insertion in model container [2023-12-21 03:11:11,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:11:11" (2/3) ... [2023-12-21 03:11:11,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775f6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:11:11, skipping insertion in model container [2023-12-21 03:11:11,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:11:11" (3/3) ... [2023-12-21 03:11:11,799 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2023-12-21 03:11:11,813 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 03:11:11,814 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 03:11:11,852 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 03:11:11,858 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;@54362fda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 03:11:11,858 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 03:11:11,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 03:11:11,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 03:11:11,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:11:11,869 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:11:11,869 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:11:11,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:11:11,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1004977553, now seen corresponding path program 1 times [2023-12-21 03:11:11,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:11:11,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074727342] [2023-12-21 03:11:11,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:11:11,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:11:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:12,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 03:11:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:12,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:11:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:12,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-21 03:11:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:12,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 03:11:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:12,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 03:11:12,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:11:12,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074727342] [2023-12-21 03:11:12,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074727342] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:11:12,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:11:12,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 03:11:12,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904873903] [2023-12-21 03:11:12,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:11:12,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:11:12,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:11:12,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:11:12,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:11:12,161 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-21 03:11:12,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:11:12,261 INFO L93 Difference]: Finished difference Result 73 states and 105 transitions. [2023-12-21 03:11:12,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:11:12,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2023-12-21 03:11:12,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:11:12,268 INFO L225 Difference]: With dead ends: 73 [2023-12-21 03:11:12,268 INFO L226 Difference]: Without dead ends: 40 [2023-12-21 03:11:12,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-21 03:11:12,272 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 44 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:11:12,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 33 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:11:12,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-21 03:11:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2023-12-21 03:11:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 03:11:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-12-21 03:11:12,297 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 28 [2023-12-21 03:11:12,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:11:12,298 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-12-21 03:11:12,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-21 03:11:12,298 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-12-21 03:11:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 03:11:12,299 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:11:12,299 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:11:12,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 03:11:12,299 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:11:12,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:11:12,300 INFO L85 PathProgramCache]: Analyzing trace with hash -796399061, now seen corresponding path program 1 times [2023-12-21 03:11:12,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:11:12,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019382643] [2023-12-21 03:11:12,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:11:12,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:11:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:12,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 03:11:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:12,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:11:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:12,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-21 03:11:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:12,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 03:11:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 03:11:12,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:11:12,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019382643] [2023-12-21 03:11:12,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019382643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:11:12,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:11:12,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 03:11:12,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646207256] [2023-12-21 03:11:12,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:11:12,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 03:11:12,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:11:12,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 03:11:12,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 03:11:12,405 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-21 03:11:12,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:11:12,490 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2023-12-21 03:11:12,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 03:11:12,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2023-12-21 03:11:12,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:11:12,491 INFO L225 Difference]: With dead ends: 68 [2023-12-21 03:11:12,492 INFO L226 Difference]: Without dead ends: 41 [2023-12-21 03:11:12,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:11:12,493 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 44 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:11:12,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 35 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:11:12,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-21 03:11:12,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2023-12-21 03:11:12,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 03:11:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-12-21 03:11:12,502 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 28 [2023-12-21 03:11:12,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:11:12,502 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-12-21 03:11:12,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-21 03:11:12,502 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-12-21 03:11:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-21 03:11:12,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:11:12,503 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:11:12,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 03:11:12,504 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:11:12,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:11:12,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2139651666, now seen corresponding path program 1 times [2023-12-21 03:11:12,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:11:12,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905923522] [2023-12-21 03:11:12,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:11:12,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:11:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:12,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 03:11:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:12,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:11:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:12,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 03:11:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:12,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 03:11:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 03:11:12,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:11:12,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905923522] [2023-12-21 03:11:12,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905923522] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:11:12,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032122406] [2023-12-21 03:11:12,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:11:12,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:11:12,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:11:12,631 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-21 03:11:12,638 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-21 03:11:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:12,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 03:11:12,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:11:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:11:12,728 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 03:11:12,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032122406] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:11:12,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 03:11:12,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-21 03:11:12,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285134677] [2023-12-21 03:11:12,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:11:12,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 03:11:12,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:11:12,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 03:11:12,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-21 03:11:12,730 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 03:11:12,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:11:12,746 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2023-12-21 03:11:12,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 03:11:12,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-12-21 03:11:12,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:11:12,747 INFO L225 Difference]: With dead ends: 52 [2023-12-21 03:11:12,747 INFO L226 Difference]: Without dead ends: 34 [2023-12-21 03:11:12,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-21 03:11:12,748 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:11:12,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 58 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:11:12,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-21 03:11:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2023-12-21 03:11:12,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 03:11:12,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-12-21 03:11:12,759 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 29 [2023-12-21 03:11:12,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:11:12,759 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-12-21 03:11:12,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 03:11:12,759 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2023-12-21 03:11:12,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-21 03:11:12,760 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:11:12,761 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:11:12,783 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-21 03:11:12,966 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-21 03:11:12,966 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:11:12,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:11:12,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1629580944, now seen corresponding path program 1 times [2023-12-21 03:11:12,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:11:12,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119189967] [2023-12-21 03:11:12,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:11:12,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:11:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:13,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 03:11:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:13,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:11:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:13,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 03:11:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:13,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 03:11:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:11:13,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:11:13,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119189967] [2023-12-21 03:11:13,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119189967] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:11:13,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150548465] [2023-12-21 03:11:13,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:11:13,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:11:13,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:11:13,096 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-21 03:11:13,110 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-21 03:11:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:13,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 03:11:13,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:11:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:11:13,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:11:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:11:13,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150548465] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:11:13,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:11:13,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 4] total 7 [2023-12-21 03:11:13,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766322470] [2023-12-21 03:11:13,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:11:13,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 03:11:13,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:11:13,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 03:11:13,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 03:11:13,240 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 03:11:13,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:11:13,341 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2023-12-21 03:11:13,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 03:11:13,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 31 [2023-12-21 03:11:13,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:11:13,342 INFO L225 Difference]: With dead ends: 71 [2023-12-21 03:11:13,342 INFO L226 Difference]: Without dead ends: 43 [2023-12-21 03:11:13,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-21 03:11:13,343 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 43 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:11:13,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 37 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:11:13,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-21 03:11:13,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2023-12-21 03:11:13,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 03:11:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2023-12-21 03:11:13,347 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 31 [2023-12-21 03:11:13,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:11:13,348 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2023-12-21 03:11:13,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 03:11:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2023-12-21 03:11:13,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-21 03:11:13,348 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:11:13,349 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:11:13,365 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-21 03:11:13,553 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-21 03:11:13,554 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:11:13,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:11:13,554 INFO L85 PathProgramCache]: Analyzing trace with hash -751355927, now seen corresponding path program 2 times [2023-12-21 03:11:13,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:11:13,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878588255] [2023-12-21 03:11:13,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:11:13,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:11:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:13,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 03:11:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:13,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 03:11:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:13,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:11:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:13,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 03:11:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 03:11:13,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:11:13,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878588255] [2023-12-21 03:11:13,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878588255] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:11:13,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:11:13,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 03:11:13,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537003232] [2023-12-21 03:11:13,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:11:13,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 03:11:13,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:11:13,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 03:11:13,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-21 03:11:13,974 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-21 03:11:14,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:11:14,379 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2023-12-21 03:11:14,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 03:11:14,380 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2023-12-21 03:11:14,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:11:14,383 INFO L225 Difference]: With dead ends: 84 [2023-12-21 03:11:14,383 INFO L226 Difference]: Without dead ends: 73 [2023-12-21 03:11:14,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2023-12-21 03:11:14,385 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 132 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 03:11:14,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 58 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 03:11:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-21 03:11:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2023-12-21 03:11:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 45 states have internal predecessors, (57), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2023-12-21 03:11:14,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2023-12-21 03:11:14,402 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 32 [2023-12-21 03:11:14,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:11:14,403 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2023-12-21 03:11:14,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-21 03:11:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2023-12-21 03:11:14,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 03:11:14,406 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:11:14,406 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:11:14,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 03:11:14,407 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:11:14,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:11:14,408 INFO L85 PathProgramCache]: Analyzing trace with hash -974269589, now seen corresponding path program 1 times [2023-12-21 03:11:14,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:11:14,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733868885] [2023-12-21 03:11:14,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:11:14,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:11:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:14,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 03:11:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:14,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 03:11:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:14,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:11:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:14,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-21 03:11:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:11:14,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:11:14,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733868885] [2023-12-21 03:11:14,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733868885] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:11:14,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942121615] [2023-12-21 03:11:14,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:11:14,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:11:14,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:11:14,473 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-21 03:11:14,508 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-21 03:11:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:14,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 03:11:14,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:11:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-21 03:11:14,578 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:11:14,604 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:11:14,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942121615] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:11:14,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:11:14,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2023-12-21 03:11:14,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167075011] [2023-12-21 03:11:14,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:11:14,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 03:11:14,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:11:14,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 03:11:14,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:11:14,606 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 03:11:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:11:14,748 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2023-12-21 03:11:14,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 03:11:14,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2023-12-21 03:11:14,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:11:14,749 INFO L225 Difference]: With dead ends: 109 [2023-12-21 03:11:14,749 INFO L226 Difference]: Without dead ends: 69 [2023-12-21 03:11:14,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-21 03:11:14,750 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 59 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:11:14,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 40 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:11:14,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-21 03:11:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2023-12-21 03:11:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 47 states have internal predecessors, (59), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2023-12-21 03:11:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2023-12-21 03:11:14,757 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 34 [2023-12-21 03:11:14,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:11:14,757 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2023-12-21 03:11:14,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 03:11:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2023-12-21 03:11:14,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-21 03:11:14,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:11:14,758 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:11:14,765 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-21 03:11:14,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:11:14,963 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:11:14,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:11:14,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2135827361, now seen corresponding path program 1 times [2023-12-21 03:11:14,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:11:14,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991655701] [2023-12-21 03:11:14,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:11:14,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:11:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:15,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 03:11:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:15,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 03:11:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:15,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:11:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:15,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 03:11:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:11:15,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:11:15,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991655701] [2023-12-21 03:11:15,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991655701] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:11:15,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187655679] [2023-12-21 03:11:15,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:11:15,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:11:15,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:11:15,371 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-21 03:11:15,394 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-21 03:11:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:15,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-21 03:11:15,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:11:15,653 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 11 treesize of output 7 [2023-12-21 03:11:15,694 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 7 treesize of output 3 [2023-12-21 03:11:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:11:15,767 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:11:15,899 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 15 treesize of output 13 [2023-12-21 03:11:15,901 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 20 treesize of output 18 [2023-12-21 03:11:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:11:16,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187655679] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:11:16,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:11:16,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 37 [2023-12-21 03:11:16,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436448916] [2023-12-21 03:11:16,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:11:16,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-21 03:11:16,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:11:16,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-21 03:11:16,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1201, Unknown=0, NotChecked=0, Total=1332 [2023-12-21 03:11:16,026 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 37 states, 32 states have (on average 1.78125) internal successors, (57), 26 states have internal predecessors, (57), 9 states have call successors, (13), 9 states have call predecessors, (13), 10 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2023-12-21 03:11:16,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:11:16,809 INFO L93 Difference]: Finished difference Result 131 states and 161 transitions. [2023-12-21 03:11:16,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 03:11:16,809 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 32 states have (on average 1.78125) internal successors, (57), 26 states have internal predecessors, (57), 9 states have call successors, (13), 9 states have call predecessors, (13), 10 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) Word has length 35 [2023-12-21 03:11:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:11:16,811 INFO L225 Difference]: With dead ends: 131 [2023-12-21 03:11:16,811 INFO L226 Difference]: Without dead ends: 100 [2023-12-21 03:11:16,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=356, Invalid=2400, Unknown=0, NotChecked=0, Total=2756 [2023-12-21 03:11:16,813 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 260 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 03:11:16,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 103 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 03:11:16,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-21 03:11:16,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2023-12-21 03:11:16,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.328125) internal successors, (85), 68 states have internal predecessors, (85), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) [2023-12-21 03:11:16,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 111 transitions. [2023-12-21 03:11:16,838 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 111 transitions. Word has length 35 [2023-12-21 03:11:16,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:11:16,838 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 111 transitions. [2023-12-21 03:11:16,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 32 states have (on average 1.78125) internal successors, (57), 26 states have internal predecessors, (57), 9 states have call successors, (13), 9 states have call predecessors, (13), 10 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2023-12-21 03:11:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 111 transitions. [2023-12-21 03:11:16,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 03:11:16,841 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:11:16,841 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:11:16,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-21 03:11:17,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:11:17,047 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:11:17,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:11:17,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1726055391, now seen corresponding path program 1 times [2023-12-21 03:11:17,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:11:17,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859825113] [2023-12-21 03:11:17,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:11:17,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:11:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:17,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 03:11:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:17,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 03:11:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:17,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:11:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:17,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-21 03:11:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:11:17,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:11:17,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859825113] [2023-12-21 03:11:17,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859825113] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:11:17,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850474118] [2023-12-21 03:11:17,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:11:17,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:11:17,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:11:17,951 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-21 03:11:17,964 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-21 03:11:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:18,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-21 03:11:18,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:11:18,275 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 11 treesize of output 7 [2023-12-21 03:11:18,331 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 7 treesize of output 3 [2023-12-21 03:11:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:11:18,479 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:11:18,765 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 17 treesize of output 15 [2023-12-21 03:11:18,768 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 22 treesize of output 18 [2023-12-21 03:11:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:11:19,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850474118] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:11:19,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:11:19,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 16] total 53 [2023-12-21 03:11:19,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123321884] [2023-12-21 03:11:19,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:11:19,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-12-21 03:11:19,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:11:19,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-12-21 03:11:19,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2568, Unknown=0, NotChecked=0, Total=2756 [2023-12-21 03:11:19,002 INFO L87 Difference]: Start difference. First operand 88 states and 111 transitions. Second operand has 53 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 39 states have internal predecessors, (71), 11 states have call successors, (14), 10 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-21 03:11:22,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:11:22,437 INFO L93 Difference]: Finished difference Result 291 states and 376 transitions. [2023-12-21 03:11:22,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-12-21 03:11:22,437 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 39 states have internal predecessors, (71), 11 states have call successors, (14), 10 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) Word has length 36 [2023-12-21 03:11:22,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:11:22,439 INFO L225 Difference]: With dead ends: 291 [2023-12-21 03:11:22,439 INFO L226 Difference]: Without dead ends: 265 [2023-12-21 03:11:22,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3031 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1426, Invalid=11914, Unknown=0, NotChecked=0, Total=13340 [2023-12-21 03:11:22,443 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 515 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 2199 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:11:22,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 126 Invalid, 2340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 2199 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-21 03:11:22,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-12-21 03:11:22,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 184. [2023-12-21 03:11:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 140 states have (on average 1.3714285714285714) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 16 states have call predecessors, (20), 23 states have return successors, (32), 19 states have call predecessors, (32), 13 states have call successors, (32) [2023-12-21 03:11:22,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 244 transitions. [2023-12-21 03:11:22,476 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 244 transitions. Word has length 36 [2023-12-21 03:11:22,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:11:22,477 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 244 transitions. [2023-12-21 03:11:22,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 39 states have internal predecessors, (71), 11 states have call successors, (14), 10 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-21 03:11:22,477 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 244 transitions. [2023-12-21 03:11:22,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-21 03:11:22,477 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:11:22,477 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:11:22,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-21 03:11:22,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:11:22,683 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:11:22,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:11:22,684 INFO L85 PathProgramCache]: Analyzing trace with hash -825822554, now seen corresponding path program 1 times [2023-12-21 03:11:22,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:11:22,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44234826] [2023-12-21 03:11:22,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:11:22,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:11:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:22,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 03:11:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:23,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 03:11:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:23,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:11:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:23,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-21 03:11:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-21 03:11:23,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:11:23,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44234826] [2023-12-21 03:11:23,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44234826] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:11:23,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192974642] [2023-12-21 03:11:23,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:11:23,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:11:23,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:11:23,328 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-21 03:11:23,366 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-21 03:11:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:11:23,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-21 03:11:23,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:11:23,513 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 11 treesize of output 7 [2023-12-21 03:11:23,541 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 7 treesize of output 3 [2023-12-21 03:11:23,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:11:23,640 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 21 treesize of output 20 [2023-12-21 03:11:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:11:23,826 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:11:24,058 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 16 treesize of output 14 [2023-12-21 03:11:24,060 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 16 treesize of output 12 [2023-12-21 03:11:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:11:24,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192974642] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:11:24,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:11:24,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 10] total 37 [2023-12-21 03:11:24,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805050195] [2023-12-21 03:11:24,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:11:24,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-21 03:11:24,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:11:24,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-21 03:11:24,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1197, Unknown=6, NotChecked=0, Total=1332 [2023-12-21 03:11:24,107 INFO L87 Difference]: Start difference. First operand 184 states and 244 transitions. Second operand has 37 states, 34 states have (on average 2.176470588235294) internal successors, (74), 30 states have internal predecessors, (74), 10 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2023-12-21 03:11:33,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:11:37,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:11:41,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:11:45,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:11:53,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:12:06,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:12:10,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:12:14,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:12:18,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:12:26,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:12:30,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:12:34,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:12:38,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:12:42,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:12:46,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:12:50,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:12:54,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:13:02,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:13:06,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:13:10,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:13:14,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:13:18,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:13:22,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:13:26,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:13:30,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:13:38,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:13:42,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:13:46,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:13:54,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:13:58,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:14:02,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:14:06,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:14:10,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:14:14,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:14:14,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:14:14,991 INFO L93 Difference]: Finished difference Result 427 states and 558 transitions. [2023-12-21 03:14:14,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-12-21 03:14:14,994 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 2.176470588235294) internal successors, (74), 30 states have internal predecessors, (74), 10 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) Word has length 37 [2023-12-21 03:14:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:14:14,995 INFO L225 Difference]: With dead ends: 427 [2023-12-21 03:14:14,996 INFO L226 Difference]: Without dead ends: 353 [2023-12-21 03:14:14,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=1000, Invalid=6638, Unknown=18, NotChecked=0, Total=7656 [2023-12-21 03:14:14,998 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 462 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 127 mSolverCounterUnsat, 54 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 137.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 54 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 137.2s IncrementalHoareTripleChecker+Time [2023-12-21 03:14:14,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 86 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1604 Invalid, 54 Unknown, 0 Unchecked, 137.2s Time] [2023-12-21 03:14:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2023-12-21 03:14:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 256. [2023-12-21 03:14:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 194 states have (on average 1.402061855670103) internal successors, (272), 209 states have internal predecessors, (272), 28 states have call successors, (28), 19 states have call predecessors, (28), 33 states have return successors, (49), 27 states have call predecessors, (49), 18 states have call successors, (49) [2023-12-21 03:14:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 349 transitions. [2023-12-21 03:14:15,033 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 349 transitions. Word has length 37 [2023-12-21 03:14:15,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:14:15,033 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 349 transitions. [2023-12-21 03:14:15,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 2.176470588235294) internal successors, (74), 30 states have internal predecessors, (74), 10 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2023-12-21 03:14:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 349 transitions. [2023-12-21 03:14:15,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-21 03:14:15,035 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:14:15,035 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:14:15,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-21 03:14:15,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:14:15,235 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:14:15,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:14:15,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1113607788, now seen corresponding path program 1 times [2023-12-21 03:14:15,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:14:15,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471195410] [2023-12-21 03:14:15,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:14:15,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:14:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:15,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 03:14:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:15,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 03:14:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:15,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:14:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:15,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 03:14:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 03:14:15,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:14:15,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471195410] [2023-12-21 03:14:15,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471195410] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:14:15,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987402182] [2023-12-21 03:14:15,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:14:15,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:14:15,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:14:15,842 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-21 03:14:15,843 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-21 03:14:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:15,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-21 03:14:15,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:14:16,007 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 11 treesize of output 7 [2023-12-21 03:14:16,212 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 7 treesize of output 3 [2023-12-21 03:14:16,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:14:16,337 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 27 treesize of output 11 [2023-12-21 03:14:16,344 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 7 treesize of output 3 [2023-12-21 03:14:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 03:14:16,544 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:14:17,012 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 17 treesize of output 15 [2023-12-21 03:14:17,013 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 22 treesize of output 18 [2023-12-21 03:14:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:14:17,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987402182] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:14:17,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:14:17,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 15] total 47 [2023-12-21 03:14:17,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991739553] [2023-12-21 03:14:17,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:14:17,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-12-21 03:14:17,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:14:17,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-12-21 03:14:17,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2000, Unknown=15, NotChecked=0, Total=2162 [2023-12-21 03:14:17,073 INFO L87 Difference]: Start difference. First operand 256 states and 349 transitions. Second operand has 47 states, 44 states have (on average 1.7954545454545454) internal successors, (79), 38 states have internal predecessors, (79), 7 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-12-21 03:14:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:14:18,664 INFO L93 Difference]: Finished difference Result 342 states and 450 transitions. [2023-12-21 03:14:18,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-21 03:14:18,670 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 1.7954545454545454) internal successors, (79), 38 states have internal predecessors, (79), 7 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) Word has length 38 [2023-12-21 03:14:18,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:14:18,671 INFO L225 Difference]: With dead ends: 342 [2023-12-21 03:14:18,671 INFO L226 Difference]: Without dead ends: 154 [2023-12-21 03:14:18,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=471, Invalid=4626, Unknown=15, NotChecked=0, Total=5112 [2023-12-21 03:14:18,673 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 135 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 47 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 03:14:18,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 124 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1331 Invalid, 9 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 03:14:18,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-12-21 03:14:18,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 138. [2023-12-21 03:14:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 110 states have (on average 1.3454545454545455) internal successors, (148), 113 states have internal predecessors, (148), 14 states have call successors, (14), 11 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2023-12-21 03:14:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 175 transitions. [2023-12-21 03:14:18,685 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 175 transitions. Word has length 38 [2023-12-21 03:14:18,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:14:18,685 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 175 transitions. [2023-12-21 03:14:18,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 1.7954545454545454) internal successors, (79), 38 states have internal predecessors, (79), 7 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-12-21 03:14:18,685 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 175 transitions. [2023-12-21 03:14:18,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-21 03:14:18,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:14:18,686 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:14:18,693 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-21 03:14:18,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:14:18,891 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:14:18,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:14:18,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1170195115, now seen corresponding path program 2 times [2023-12-21 03:14:18,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:14:18,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390661732] [2023-12-21 03:14:18,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:14:18,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:14:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:18,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 03:14:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:18,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 03:14:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:18,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:14:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:18,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-21 03:14:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-21 03:14:18,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:14:18,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390661732] [2023-12-21 03:14:18,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390661732] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:14:18,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:14:18,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 03:14:18,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37393422] [2023-12-21 03:14:18,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:14:18,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 03:14:18,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:14:18,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 03:14:18,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-21 03:14:18,987 INFO L87 Difference]: Start difference. First operand 138 states and 175 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-21 03:14:19,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:14:19,128 INFO L93 Difference]: Finished difference Result 177 states and 222 transitions. [2023-12-21 03:14:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 03:14:19,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2023-12-21 03:14:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:14:19,130 INFO L225 Difference]: With dead ends: 177 [2023-12-21 03:14:19,130 INFO L226 Difference]: Without dead ends: 109 [2023-12-21 03:14:19,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2023-12-21 03:14:19,131 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 50 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:14:19,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 39 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:14:19,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-21 03:14:19,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2023-12-21 03:14:19,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.2625) internal successors, (101), 82 states have internal predecessors, (101), 11 states have call successors, (11), 9 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2023-12-21 03:14:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2023-12-21 03:14:19,142 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 40 [2023-12-21 03:14:19,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:14:19,143 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2023-12-21 03:14:19,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-21 03:14:19,143 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2023-12-21 03:14:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-21 03:14:19,143 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:14:19,143 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:14:19,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 03:14:19,143 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:14:19,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:14:19,144 INFO L85 PathProgramCache]: Analyzing trace with hash -735499196, now seen corresponding path program 2 times [2023-12-21 03:14:19,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:14:19,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696881402] [2023-12-21 03:14:19,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:14:19,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:14:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:19,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 03:14:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:19,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 03:14:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:19,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:14:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:19,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 03:14:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:14:19,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:14:19,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696881402] [2023-12-21 03:14:19,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696881402] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:14:19,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85629382] [2023-12-21 03:14:19,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:14:19,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:14:19,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:14:19,216 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-21 03:14:19,241 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-21 03:14:19,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 03:14:19,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:14:19,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 03:14:19,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:14:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:14:19,381 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 03:14:19,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85629382] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:14:19,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 03:14:19,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2023-12-21 03:14:19,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964459371] [2023-12-21 03:14:19,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:14:19,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 03:14:19,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:14:19,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 03:14:19,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 03:14:19,383 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-21 03:14:19,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:14:19,429 INFO L93 Difference]: Finished difference Result 170 states and 207 transitions. [2023-12-21 03:14:19,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:14:19,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2023-12-21 03:14:19,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:14:19,431 INFO L225 Difference]: With dead ends: 170 [2023-12-21 03:14:19,431 INFO L226 Difference]: Without dead ends: 97 [2023-12-21 03:14:19,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 03:14:19,432 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:14:19,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 81 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:14:19,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-21 03:14:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2023-12-21 03:14:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 77 states have internal predecessors, (88), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-21 03:14:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2023-12-21 03:14:19,441 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 40 [2023-12-21 03:14:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:14:19,441 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2023-12-21 03:14:19,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-21 03:14:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2023-12-21 03:14:19,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-21 03:14:19,442 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:14:19,442 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:14:19,456 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-21 03:14:19,648 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,SelfDestructingSolverStorable11 [2023-12-21 03:14:19,648 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:14:19,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:14:19,649 INFO L85 PathProgramCache]: Analyzing trace with hash 81462299, now seen corresponding path program 1 times [2023-12-21 03:14:19,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:14:19,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322783015] [2023-12-21 03:14:19,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:14:19,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:14:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:19,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 03:14:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:19,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 03:14:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:19,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:14:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:19,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 03:14:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:19,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-21 03:14:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:14:19,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:14:19,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322783015] [2023-12-21 03:14:19,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322783015] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:14:19,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420565319] [2023-12-21 03:14:19,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:14:19,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:14:19,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:14:19,781 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:14:19,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-21 03:14:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:19,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 03:14:19,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:14:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:14:19,919 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:14:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:14:19,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420565319] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:14:19,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:14:19,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 7 [2023-12-21 03:14:19,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374732924] [2023-12-21 03:14:19,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:14:19,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 03:14:19,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:14:19,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 03:14:19,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 03:14:19,941 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-21 03:14:20,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:14:20,073 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2023-12-21 03:14:20,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 03:14:20,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 44 [2023-12-21 03:14:20,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:14:20,074 INFO L225 Difference]: With dead ends: 122 [2023-12-21 03:14:20,075 INFO L226 Difference]: Without dead ends: 102 [2023-12-21 03:14:20,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-21 03:14:20,076 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 86 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:14:20,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 49 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:14:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-21 03:14:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2023-12-21 03:14:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 77 states have internal predecessors, (86), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-21 03:14:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2023-12-21 03:14:20,085 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 44 [2023-12-21 03:14:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:14:20,085 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2023-12-21 03:14:20,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-21 03:14:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2023-12-21 03:14:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-21 03:14:20,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:14:20,086 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:14:20,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-21 03:14:20,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-21 03:14:20,292 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:14:20,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:14:20,293 INFO L85 PathProgramCache]: Analyzing trace with hash 523876967, now seen corresponding path program 1 times [2023-12-21 03:14:20,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:14:20,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401302269] [2023-12-21 03:14:20,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:14:20,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:14:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:20,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 03:14:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:20,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 03:14:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:20,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:14:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:20,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 03:14:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:21,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-21 03:14:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:21,018 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-21 03:14:21,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:14:21,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401302269] [2023-12-21 03:14:21,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401302269] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:14:21,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814595284] [2023-12-21 03:14:21,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:14:21,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:14:21,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:14:21,040 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:14:21,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-21 03:14:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:21,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-21 03:14:21,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:14:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-21 03:14:21,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:14:21,532 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 17 treesize of output 9 [2023-12-21 03:14:21,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:14:21,630 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 20 treesize of output 16 [2023-12-21 03:14:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:14:21,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814595284] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:14:21,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:14:21,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 16] total 41 [2023-12-21 03:14:21,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650442269] [2023-12-21 03:14:21,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:14:21,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-21 03:14:21,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:14:21,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-21 03:14:21,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1518, Unknown=0, NotChecked=0, Total=1640 [2023-12-21 03:14:21,822 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 41 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 29 states have internal predecessors, (77), 8 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2023-12-21 03:14:23,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:14:23,103 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2023-12-21 03:14:23,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-21 03:14:23,104 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 29 states have internal predecessors, (77), 8 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) Word has length 47 [2023-12-21 03:14:23,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:14:23,104 INFO L225 Difference]: With dead ends: 112 [2023-12-21 03:14:23,104 INFO L226 Difference]: Without dead ends: 94 [2023-12-21 03:14:23,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=440, Invalid=3592, Unknown=0, NotChecked=0, Total=4032 [2023-12-21 03:14:23,106 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 188 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 03:14:23,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 102 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 03:14:23,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-21 03:14:23,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2023-12-21 03:14:23,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 72 states have internal predecessors, (77), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-21 03:14:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2023-12-21 03:14:23,118 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 47 [2023-12-21 03:14:23,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:14:23,118 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2023-12-21 03:14:23,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 29 states have internal predecessors, (77), 8 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2023-12-21 03:14:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2023-12-21 03:14:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-21 03:14:23,119 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:14:23,119 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:14:23,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-21 03:14:23,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-21 03:14:23,326 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:14:23,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:14:23,326 INFO L85 PathProgramCache]: Analyzing trace with hash -681727901, now seen corresponding path program 2 times [2023-12-21 03:14:23,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:14:23,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515062911] [2023-12-21 03:14:23,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:14:23,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:14:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:23,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 03:14:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:23,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 03:14:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:23,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:14:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:23,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 03:14:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:23,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-21 03:14:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:14:23,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:14:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515062911] [2023-12-21 03:14:23,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515062911] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:14:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891617022] [2023-12-21 03:14:23,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:14:23,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:14:23,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:14:23,769 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:14:23,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-21 03:14:23,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 03:14:23,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:14:23,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 03:14:23,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:14:24,018 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 11 treesize of output 7 [2023-12-21 03:14:24,039 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 7 treesize of output 3 [2023-12-21 03:14:24,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:14:24,187 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 27 treesize of output 11 [2023-12-21 03:14:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 16 refuted. 5 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-21 03:14:24,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:14:24,460 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 16 treesize of output 14 [2023-12-21 03:14:24,461 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 16 treesize of output 12 [2023-12-21 03:14:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-21 03:14:24,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891617022] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:14:24,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:14:24,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 10] total 30 [2023-12-21 03:14:24,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788033639] [2023-12-21 03:14:24,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:14:24,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-21 03:14:24,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:14:24,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-21 03:14:24,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=746, Unknown=5, NotChecked=0, Total=870 [2023-12-21 03:14:24,478 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 26 states have internal predecessors, (91), 4 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-21 03:14:25,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:14:25,278 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2023-12-21 03:14:25,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-21 03:14:25,279 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 26 states have internal predecessors, (91), 4 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 50 [2023-12-21 03:14:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:14:25,280 INFO L225 Difference]: With dead ends: 107 [2023-12-21 03:14:25,280 INFO L226 Difference]: Without dead ends: 92 [2023-12-21 03:14:25,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=486, Invalid=2161, Unknown=5, NotChecked=0, Total=2652 [2023-12-21 03:14:25,281 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 164 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 03:14:25,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 108 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 03:14:25,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-21 03:14:25,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2023-12-21 03:14:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 63 states have internal predecessors, (65), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-21 03:14:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2023-12-21 03:14:25,295 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 50 [2023-12-21 03:14:25,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:14:25,296 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2023-12-21 03:14:25,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 26 states have internal predecessors, (91), 4 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-21 03:14:25,296 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2023-12-21 03:14:25,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-21 03:14:25,297 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:14:25,297 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:14:25,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-21 03:14:25,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-21 03:14:25,506 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:14:25,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:14:25,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1771141427, now seen corresponding path program 3 times [2023-12-21 03:14:25,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:14:25,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423979689] [2023-12-21 03:14:25,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:14:25,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:14:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:25,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 03:14:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:26,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 03:14:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:26,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:14:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:26,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 03:14:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:26,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-21 03:14:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-21 03:14:26,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:14:26,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423979689] [2023-12-21 03:14:26,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423979689] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:14:26,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596766296] [2023-12-21 03:14:26,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 03:14:26,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:14:26,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:14:26,449 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:14:26,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-21 03:14:27,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-21 03:14:27,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:14:27,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 78 conjunts are in the unsatisfiable core [2023-12-21 03:14:27,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:14:27,153 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 11 treesize of output 7 [2023-12-21 03:14:27,156 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 11 treesize of output 7 [2023-12-21 03:14:27,201 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 7 treesize of output 3 [2023-12-21 03:14:27,204 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 7 treesize of output 3 [2023-12-21 03:14:27,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:14:27,335 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 27 treesize of output 11 [2023-12-21 03:14:27,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:14:27,338 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 27 treesize of output 11 [2023-12-21 03:14:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:14:27,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:14:27,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596766296] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:14:27,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:14:27,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 42 [2023-12-21 03:14:27,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226192220] [2023-12-21 03:14:27,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:14:27,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-21 03:14:27,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:14:27,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-21 03:14:27,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1720, Unknown=7, NotChecked=0, Total=1892 [2023-12-21 03:14:27,840 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 43 states, 36 states have (on average 1.75) internal successors, (63), 30 states have internal predecessors, (63), 8 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-12-21 03:14:29,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:14:29,302 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2023-12-21 03:14:29,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-21 03:14:29,303 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 36 states have (on average 1.75) internal successors, (63), 30 states have internal predecessors, (63), 8 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 50 [2023-12-21 03:14:29,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:14:29,303 INFO L225 Difference]: With dead ends: 108 [2023-12-21 03:14:29,303 INFO L226 Difference]: Without dead ends: 89 [2023-12-21 03:14:29,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=674, Invalid=4721, Unknown=7, NotChecked=0, Total=5402 [2023-12-21 03:14:29,305 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 273 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 53 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 03:14:29,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 74 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1275 Invalid, 9 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 03:14:29,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-21 03:14:29,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2023-12-21 03:14:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.032258064516129) internal successors, (64), 63 states have internal predecessors, (64), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-21 03:14:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2023-12-21 03:14:29,313 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 50 [2023-12-21 03:14:29,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:14:29,313 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2023-12-21 03:14:29,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 36 states have (on average 1.75) internal successors, (63), 30 states have internal predecessors, (63), 8 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-12-21 03:14:29,313 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2023-12-21 03:14:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-21 03:14:29,314 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:14:29,314 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:14:29,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-21 03:14:29,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-21 03:14:29,521 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:14:29,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:14:29,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1769088504, now seen corresponding path program 4 times [2023-12-21 03:14:29,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:14:29,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494013953] [2023-12-21 03:14:29,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:14:29,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:14:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:30,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 03:14:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:30,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 03:14:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:30,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:14:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:30,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 03:14:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:30,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-21 03:14:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:30,736 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:14:30,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:14:30,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494013953] [2023-12-21 03:14:30,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494013953] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:14:30,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807165251] [2023-12-21 03:14:30,737 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 03:14:30,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:14:30,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:14:30,738 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:14:30,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-21 03:14:30,900 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 03:14:30,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:14:30,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-21 03:14:30,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:14:31,149 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 19 treesize of output 1 [2023-12-21 03:14:31,347 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 03:14:31,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:14:31,665 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-21 03:14:31,667 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 24 treesize of output 20 [2023-12-21 03:14:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 03:14:31,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807165251] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:14:31,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:14:31,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 17, 17] total 49 [2023-12-21 03:14:31,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251956472] [2023-12-21 03:14:31,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:14:31,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-21 03:14:31,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:14:31,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-21 03:14:31,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2222, Unknown=0, NotChecked=0, Total=2352 [2023-12-21 03:14:31,861 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 49 states, 40 states have (on average 2.1) internal successors, (84), 38 states have internal predecessors, (84), 10 states have call successors, (12), 7 states have call predecessors, (12), 10 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) [2023-12-21 03:14:33,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:14:33,747 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2023-12-21 03:14:33,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-21 03:14:33,747 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 40 states have (on average 2.1) internal successors, (84), 38 states have internal predecessors, (84), 10 states have call successors, (12), 7 states have call predecessors, (12), 10 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) Word has length 52 [2023-12-21 03:14:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:14:33,748 INFO L225 Difference]: With dead ends: 89 [2023-12-21 03:14:33,748 INFO L226 Difference]: Without dead ends: 54 [2023-12-21 03:14:33,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 84 SyntacticMatches, 9 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=512, Invalid=5650, Unknown=0, NotChecked=0, Total=6162 [2023-12-21 03:14:33,751 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 211 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 03:14:33,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 100 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 03:14:33,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-21 03:14:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-12-21 03:14:33,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 03:14:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2023-12-21 03:14:33,758 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2023-12-21 03:14:33,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:14:33,758 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2023-12-21 03:14:33,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 40 states have (on average 2.1) internal successors, (84), 38 states have internal predecessors, (84), 10 states have call successors, (12), 7 states have call predecessors, (12), 10 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) [2023-12-21 03:14:33,758 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2023-12-21 03:14:33,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-21 03:14:33,759 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:14:33,759 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:14:33,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-21 03:14:33,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-21 03:14:33,962 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:14:33,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:14:33,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1552570588, now seen corresponding path program 1 times [2023-12-21 03:14:33,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:14:33,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525477916] [2023-12-21 03:14:33,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:14:33,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:14:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:34,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 03:14:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:34,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 03:14:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:34,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:14:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:34,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-21 03:14:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:34,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-21 03:14:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:34,517 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:14:34,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:14:34,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525477916] [2023-12-21 03:14:34,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525477916] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:14:34,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490873414] [2023-12-21 03:14:34,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:14:34,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:14:34,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:14:34,530 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:14:34,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-21 03:14:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:14:34,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-21 03:14:34,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:14:34,938 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 11 treesize of output 7 [2023-12-21 03:14:34,991 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 7 treesize of output 3 [2023-12-21 03:14:35,207 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:14:35,207 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:14:35,443 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 16 treesize of output 14 [2023-12-21 03:14:35,444 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 20 treesize of output 16 [2023-12-21 03:14:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 03:14:35,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490873414] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:14:35,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:14:35,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 18] total 54 [2023-12-21 03:14:35,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395844957] [2023-12-21 03:14:35,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:14:35,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-12-21 03:14:35,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:14:35,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-12-21 03:14:35,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2672, Unknown=0, NotChecked=0, Total=2862 [2023-12-21 03:14:35,656 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 54 states, 43 states have (on average 2.186046511627907) internal successors, (94), 37 states have internal predecessors, (94), 11 states have call successors, (18), 12 states have call predecessors, (18), 13 states have return successors, (15), 9 states have call predecessors, (15), 11 states have call successors, (15) [2023-12-21 03:14:36,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:14:36,623 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2023-12-21 03:14:36,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 03:14:36,624 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 43 states have (on average 2.186046511627907) internal successors, (94), 37 states have internal predecessors, (94), 11 states have call successors, (18), 12 states have call predecessors, (18), 13 states have return successors, (15), 9 states have call predecessors, (15), 11 states have call successors, (15) Word has length 53 [2023-12-21 03:14:36,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:14:36,624 INFO L225 Difference]: With dead ends: 54 [2023-12-21 03:14:36,624 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 03:14:36,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=458, Invalid=4654, Unknown=0, NotChecked=0, Total=5112 [2023-12-21 03:14:36,626 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 103 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 03:14:36,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 108 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 03:14:36,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 03:14:36,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 03:14:36,627 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-21 03:14:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 03:14:36,627 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2023-12-21 03:14:36,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:14:36,627 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 03:14:36,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 43 states have (on average 2.186046511627907) internal successors, (94), 37 states have internal predecessors, (94), 11 states have call successors, (18), 12 states have call predecessors, (18), 13 states have return successors, (15), 9 states have call predecessors, (15), 11 states have call successors, (15) [2023-12-21 03:14:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 03:14:36,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 03:14:36,630 INFO L805 garLoopResultBuilder]: Registering result SAFE for location gErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 03:14:36,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-21 03:14:36,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:14:36,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 03:14:38,809 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 48 51) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (or (= ~counter~0 |old(~counter~0)|) (not (= |~#pstate~0.offset| 0)) (not (= |~#pp~0.offset| 0)) (not (= (select .cse0 0) 0)) (not (= (select .cse0 4) 0)) (not (= (select (select |#memory_$Pointer$#1.base| |~#pp~0.base|) 4) 0)) (= |old(~counter~0)| 0))) [2023-12-21 03:14:38,810 INFO L899 garLoopResultBuilder]: For program point fake_mallocEXIT(lines 48 51) no Hoare annotation was computed. [2023-12-21 03:14:38,810 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 32) no Hoare annotation was computed. [2023-12-21 03:14:38,810 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 33) the Hoare annotation is: (let ((.cse22 (select |old(#memory_$Pointer$#1.offset)| |~#pp~0.base|))) (let ((.cse2 (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|)) (.cse11 (= f_~pointer.base |f_#in~pointer.base|)) (.cse3 (= |#memory_int#2| |old(#memory_int#2)|)) (.cse4 (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|)) (.cse5 (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|)) (.cse6 (= |#memory_int#1| |old(#memory_int#1)|)) (.cse7 (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|)) (.cse8 (= |f_#in~pointer.offset| f_~pointer.offset)) (.cse14 (select .cse22 4)) (.cse21 (select |old(#memory_$Pointer$#1.base)| |~#pp~0.base|)) (.cse12 (select |#memory_$Pointer$#1.base| |~#pp~0.base|)) (.cse20 (select .cse22 0))) (let ((.cse1 (not (= .cse20 0))) (.cse13 (not (= (select .cse12 0) 0))) (.cse15 (= (select .cse21 0) 0)) (.cse0 (not (= |~#pstate~0.offset| 0))) (.cse9 (not (= |~#pp~0.offset| 0))) (.cse18 (not (= (select .cse21 4) 0))) (.cse19 (not (= .cse14 0))) (.cse17 (and .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 (= f_~i~1 0) .cse7 .cse8)) (.cse16 (select |old(#memory_int#2)| |~#pstate~0.base|)) (.cse10 (= f_~i~1 1))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 f_~i~1)) .cse9 (and .cse10 .cse2 (or .cse11 (= f_~pointer.base (select .cse12 4))) .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse8) (not (= .cse14 1)) (and (= |f_#in~pointer.base| 0) .cse15) (not (= (select .cse16 4) 1)) .cse17) (or .cse0 .cse1 (and .cse10 (or .cse11 (= f_~pointer.base 0)) .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse8) .cse9 .cse18 .cse19 .cse17) (or (not .cse15) .cse0 .cse9 (not (= .cse20 1)) .cse18 .cse19 .cse17 (not (= (select .cse16 0) 1)) (and .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))))) [2023-12-21 03:14:38,810 INFO L899 garLoopResultBuilder]: For program point L27-4(lines 25 34) no Hoare annotation was computed. [2023-12-21 03:14:38,810 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 25 34) the Hoare annotation is: (let ((.cse11 (select |old(#memory_$Pointer$#1.offset)| |~#pp~0.base|))) (let ((.cse3 (select .cse11 0)) (.cse9 (select .cse11 4)) (.cse10 (select |old(#memory_$Pointer$#1.base)| |~#pp~0.base|))) (let ((.cse4 (not (= (select .cse10 4) 0))) (.cse6 (not (= .cse9 0))) (.cse1 (not (= |~#pstate~0.offset| 0))) (.cse8 (not (= .cse3 0))) (.cse2 (not (= |~#pp~0.offset| 0))) (.cse0 (= (select .cse10 0) 0)) (.cse5 (and (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|))) (.cse7 (select |old(#memory_int#2)| |~#pstate~0.base|))) (and (or (not .cse0) .cse1 .cse2 (not (= .cse3 1)) .cse4 .cse5 .cse6 (not (= (select .cse7 0) 1))) (or .cse1 .cse8 .cse2 .cse4 .cse5 .cse6) (or .cse1 .cse8 .cse2 (not (= .cse9 1)) (and (= |f_#in~pointer.base| 0) .cse0) .cse5 (not (= (select .cse7 4) 1))))))) [2023-12-21 03:14:38,810 INFO L899 garLoopResultBuilder]: For program point fEXIT(lines 25 34) no Hoare annotation was computed. [2023-12-21 03:14:38,810 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 36 45) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (let ((.cse14 (select .cse1 0)) (.cse15 (select (select |#memory_$Pointer$#1.base| |~#pp~0.base|) 0))) (let ((.cse13 (select |old(#memory_int#2)| |~#pstate~0.base|)) (.cse10 (= |f_#in~pointer.base| 0)) (.cse11 (= .cse15 0)) (.cse12 (= .cse14 0))) (let ((.cse5 (not .cse12)) (.cse6 (and .cse10 .cse11)) (.cse7 (= .cse15 |g_#in~pointer#1.base|)) (.cse3 (not (= |~#pstate~0.offset| 0))) (.cse0 (and (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|))) (.cse4 (not (= |~#pp~0.offset| 0))) (.cse2 (not (= 2 |g_#in~pointer#1.offset|))) (.cse9 (not (= (select .cse13 4) 1))) (.cse8 (not (= .cse14 1)))) (and (or .cse0 (not (= (select .cse1 4) 1)) .cse2 (and (or .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse3 .cse4 .cse8))) (or .cse3 .cse0 .cse4 .cse5 .cse6 .cse9 .cse7) (or .cse3 .cse0 .cse4 .cse9 (and .cse10 .cse11 .cse12) (not (= (select .cse13 0) 1))) (or .cse3 .cse0 .cse4 .cse2 .cse9 .cse8)))))) [2023-12-21 03:14:38,810 INFO L899 garLoopResultBuilder]: For program point L38-2(lines 38 44) no Hoare annotation was computed. [2023-12-21 03:14:38,811 INFO L895 garLoopResultBuilder]: At program point L38-3(lines 38 44) the Hoare annotation is: (let ((.cse37 (select |#memory_$Pointer$#1.base| |~#pp~0.base|)) (.cse35 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (let ((.cse27 (select .cse35 0)) (.cse39 (select .cse37 0))) (let ((.cse20 (= .cse39 0)) (.cse21 (= .cse27 0)) (.cse28 (select .cse35 4)) (.cse25 (select |old(#memory_int#2)| |~#pstate~0.base|)) (.cse16 (select |#memory_int#2| |~#pstate~0.base|))) (let ((.cse41 (select .cse16 4)) (.cse40 (select .cse25 4)) (.cse31 (= .cse28 1)) (.cse12 (not .cse21)) (.cse33 (not .cse20)) (.cse19 (= |f_#in~pointer.base| 0)) (.cse43 (= |~#pstate~0.offset| 0)) (.cse29 (<= 2 |g_~i~2#1|)) (.cse42 (= |~#pp~0.offset| 0))) (let ((.cse22 (not (= (select .cse25 0) 1))) (.cse6 (= |g_~pointer#1.offset| 2)) (.cse1 (and (or .cse12 .cse33 (not .cse19)) .cse43 .cse29 .cse42)) (.cse7 (not (= 2 |g_#in~pointer#1.offset|))) (.cse15 (not (= .cse27 1))) (.cse17 (<= 1 |g_~i~2#1|)) (.cse8 (= |g_~i~2#1| 0)) (.cse9 (= |g_~pointer#1.base| |g_#in~pointer#1.base|)) (.cse10 (not .cse43)) (.cse11 (not .cse42)) (.cse0 (not .cse31)) (.cse24 (= |g_~pointer#1.offset| |g_#in~pointer#1.offset|)) (.cse5 (= |g_~i~2#1| 1)) (.cse13 (and .cse19 .cse20)) (.cse18 (not (= .cse40 1))) (.cse2 (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|)) (.cse3 (= |#memory_int#2| |old(#memory_int#2)|)) (.cse4 (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|)) (.cse30 (= 2 .cse41)) (.cse32 (= .cse40 .cse41)) (.cse14 (= .cse39 |g_#in~pointer#1.base|))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 (and .cse2 .cse8 .cse3 .cse4 .cse6 .cse9) (and (or .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse10 .cse11 .cse15))) (or (and (= (select .cse16 (* |g_~i~2#1| 4)) 1) .cse17) .cse10 .cse11 (and .cse2 .cse8 .cse3 .cse4) .cse1 .cse18 (and .cse19 .cse20 .cse21) .cse22) (let ((.cse23 (= |g_~pointer#1.offset| 1))) (or (and .cse3 .cse23 .cse9) .cse10 .cse11 (and .cse24 .cse5 (exists ((v_subst_7 Int)) (and (= |#memory_int#2| (store |old(#memory_int#2)| |~#pstate~0.base| (let ((.cse26 (* 4 v_subst_7))) (store .cse25 .cse26 (select .cse16 .cse26))))) (<= v_subst_7 0)))) (not (= .cse27 |g_#in~pointer#1.offset|)) (and (<= .cse28 1) .cse29 (or (and .cse30 .cse31) .cse32)) .cse33 .cse18 .cse15 (and .cse29 .cse23 (exists ((|g_~i~2#1| Int)) (let ((.cse36 (* |g_~i~2#1| 4))) (let ((.cse34 (select .cse37 .cse36))) (and (= .cse34 |g_#in~pointer#1.base|) (= (select .cse35 .cse36) |g_#in~pointer#1.offset|) (not (= .cse34 0)))))) .cse9) (and .cse29 (exists ((v_subst_9 Int)) (and (<= v_subst_9 0) (= |#memory_int#2| (store |old(#memory_int#2)| |~#pstate~0.base| (let ((.cse38 (* 4 v_subst_9))) (store .cse25 .cse38 (select .cse16 .cse38)))))))) .cse22)) (or .cse10 .cse11 (and .cse2 .cse8 .cse3 .cse4 .cse6) .cse1 (and .cse2 .cse3 .cse4 .cse5) .cse7 .cse18 .cse15) (or .cse10 (and .cse2 .cse8 (not (= .cse39 |g_~pointer#1.base|)) .cse3 .cse4) .cse11 .cse12 .cse29 (and .cse2 .cse3 .cse4 .cse17) .cse13 .cse18 .cse14) (or (and .cse8 .cse24 .cse9) .cse10 .cse11 .cse12 .cse0 (and .cse24 .cse5) .cse13 .cse18 (and .cse2 .cse29 .cse3 .cse4) (and .cse29 (<= 1 |g_#in~pointer#1.offset|) (or (and (= |g_#in~pointer#1.offset| 1) .cse30) .cse32)) .cse14))))))) [2023-12-21 03:14:38,811 INFO L899 garLoopResultBuilder]: For program point L38-4(lines 36 45) no Hoare annotation was computed. [2023-12-21 03:14:38,811 INFO L899 garLoopResultBuilder]: For program point gErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2023-12-21 03:14:38,811 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2023-12-21 03:14:38,811 INFO L899 garLoopResultBuilder]: For program point gEXIT(lines 36 45) no Hoare annotation was computed. [2023-12-21 03:14:38,811 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-12-21 03:14:38,811 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-12-21 03:14:38,811 INFO L899 garLoopResultBuilder]: For program point L41-2(line 41) no Hoare annotation was computed. [2023-12-21 03:14:38,811 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 03:14:38,811 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse11 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (let ((.cse12 (select .cse11 0)) (.cse9 (select |#memory_int#2| |~#pstate~0.base|))) (let ((.cse2 (= (select .cse9 4) 1)) (.cse0 (= |ULTIMATE.start_main_~a~0#1.base| 0)) (.cse8 (= .cse12 0)) (.cse10 (not (= (select (select |#memory_$Pointer$#1.base| |~#pp~0.base|) 0) 0))) (.cse7 (= .cse12 1)) (.cse1 (= |~#pstate~0.offset| 0)) (.cse3 (= |ULTIMATE.start_main_~b~0#1.offset| 2)) (.cse4 (= |~#pp~0.offset| 0)) (.cse5 (= |ULTIMATE.start_main_~a~0#1.offset| 1)) (.cse6 (= |ULTIMATE.start_main_~b~0#1.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~counter~0 1)) .cse6 .cse7) (and .cse0 .cse1 (not .cse8) .cse2 (= (select .cse9 0) 1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse10 .cse4 .cse5 .cse6) (and (<= 2 ~counter~0) .cse0 (or (and .cse8 .cse10) .cse7) .cse1 .cse3 .cse4 .cse5 (= (select .cse11 4) 1) .cse6))))) [2023-12-21 03:14:38,811 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (and (<= 2 ~counter~0) (= (select .cse0 4) 0) (= |ULTIMATE.start_main_~a~0#1.base| 0) (= |~#pstate~0.offset| 0) (= (select (select |#memory_$Pointer$#1.base| |~#pp~0.base|) 4) 0) (= |ULTIMATE.start_main_~b~0#1.offset| 2) (= (select .cse0 0) 0) (= |~#pp~0.offset| 0) (= |ULTIMATE.start_main_~a~0#1.offset| 1) (= |ULTIMATE.start_main_~b~0#1.base| 0))) [2023-12-21 03:14:38,811 INFO L895 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (let ((.cse11 (select |#memory_$Pointer$#1.base| |~#pp~0.base|)) (.cse12 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (let ((.cse0 (<= 2 ~counter~0)) (.cse9 (select .cse12 4)) (.cse1 (= |ULTIMATE.start_main_~a~0#1.base| 0)) (.cse2 (= |~#pstate~0.offset| 0)) (.cse3 (select |#memory_int#2| |~#pstate~0.base|)) (.cse6 (= (select .cse11 0) 0)) (.cse4 (= |ULTIMATE.start_main_~b~0#1.offset| 2)) (.cse7 (= |~#pp~0.offset| 0)) (.cse8 (= |ULTIMATE.start_main_~a~0#1.offset| 1)) (.cse10 (= |ULTIMATE.start_main_~b~0#1.base| 0)) (.cse5 (select .cse12 0))) (or (and .cse0 .cse1 .cse2 (= (select .cse3 4) 1) .cse4 (= .cse5 0) (not .cse6) .cse7 .cse8 (= .cse9 1) .cse10) (and .cse0 (= .cse9 0) .cse1 .cse2 (= (select .cse11 4) 0) (= (select .cse3 0) 1) .cse6 .cse4 .cse7 .cse8 .cse10 (= .cse5 1))))) [2023-12-21 03:14:38,812 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (and (= (select .cse0 4) 0) (= |ULTIMATE.start_main_~a~0#1.base| 0) (= |~#pstate~0.offset| 0) (= (select (select |#memory_$Pointer$#1.base| |~#pp~0.base|) 4) 0) (= (select .cse0 0) 0) (= |~#pp~0.offset| 0) (= |ULTIMATE.start_main_~a~0#1.offset| 1) (= ~counter~0 2))) [2023-12-21 03:14:38,812 INFO L899 garLoopResultBuilder]: For program point L58-1(line 58) no Hoare annotation was computed. [2023-12-21 03:14:38,812 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2023-12-21 03:14:38,812 INFO L895 garLoopResultBuilder]: At program point L19-3(lines 19 22) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (let ((.cse0 (= (select .cse6 4) 0)) (.cse1 (= |~#pstate~0.offset| 0)) (.cse2 (= (select (select |#memory_$Pointer$#1.base| |~#pp~0.base|) 4) 0)) (.cse3 (= (select .cse6 0) 0)) (.cse4 (= |~#pp~0.offset| 0)) (.cse5 (= ~counter~0 1))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_init_~i~0#1| 0) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (<= 1 |ULTIMATE.start_init_~i~0#1|) .cse4 .cse5)))) [2023-12-21 03:14:38,812 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 03:14:38,812 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 53 71) no Hoare annotation was computed. [2023-12-21 03:14:38,812 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse11 (select |#memory_int#2| |~#pstate~0.base|)) (.cse12 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (let ((.cse0 (<= 2 ~counter~0)) (.cse1 (= |ULTIMATE.start_main_~a~0#1.base| 0)) (.cse2 (= |~#pstate~0.offset| 0)) (.cse9 (select .cse12 4)) (.cse3 (= (select .cse11 4) 1)) (.cse6 (= (select (select |#memory_$Pointer$#1.base| |~#pp~0.base|) 0) 0)) (.cse4 (= |ULTIMATE.start_main_~b~0#1.offset| 2)) (.cse7 (= |~#pp~0.offset| 0)) (.cse8 (= |ULTIMATE.start_main_~a~0#1.offset| 1)) (.cse10 (= |ULTIMATE.start_main_~b~0#1.base| 0)) (.cse5 (select .cse12 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= .cse5 0) (not .cse6) .cse7 .cse8 (= .cse9 1) .cse10) (and .cse0 .cse1 .cse2 (= .cse9 2) .cse3 (= (select .cse11 0) 1) .cse6 .cse4 .cse7 .cse8 .cse10 (= .cse5 1))))) [2023-12-21 03:14:38,812 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 60) no Hoare annotation was computed. [2023-12-21 03:14:38,812 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (and (= (select .cse0 4) 0) (= |~#pstate~0.offset| 0) (= (select (select |#memory_$Pointer$#1.base| |~#pp~0.base|) 4) 0) (= (select .cse0 0) 0) (= |~#pp~0.offset| 0) (= ~counter~0 1))) [2023-12-21 03:14:38,812 INFO L899 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2023-12-21 03:14:38,812 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-12-21 03:14:38,814 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:14:38,816 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 03:14:38,826 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated [2023-12-21 03:14:38,828 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,828 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,829 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,829 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,829 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,829 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,829 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,830 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,830 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,830 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,830 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,830 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,830 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,830 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,830 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][~i~2 * 4] could not be translated [2023-12-21 03:14:38,830 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,831 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,831 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,831 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated [2023-12-21 03:14:38,831 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,831 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,831 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,831 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][0] could not be translated [2023-12-21 03:14:38,831 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,831 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,832 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,832 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,832 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,832 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_7 : int :: #memory_int#2 == old(#memory_int#2)[~#pstate~0!base := old(#memory_int#2)[~#pstate~0!base][4 * v_subst_7 := #memory_int#2[~#pstate~0!base][4 * v_subst_7]]] && v_subst_7 <= 0) could not be translated [2023-12-21 03:14:38,832 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,832 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,832 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated [2023-12-21 03:14:38,832 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][4] could not be translated [2023-12-21 03:14:38,833 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated [2023-12-21 03:14:38,833 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated [2023-12-21 03:14:38,833 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][4] could not be translated [2023-12-21 03:14:38,833 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,833 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated [2023-12-21 03:14:38,833 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,833 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,833 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists g_~i~2#1 : int :: (#memory_$Pointer$#1.base[~#pp~0!base][g_~i~2#1 * 4] == #in~pointer!base && #memory_$Pointer$#1.offset[~#pp~0!base][g_~i~2#1 * 4] == #in~pointer!offset) && !(#memory_$Pointer$#1.base[~#pp~0!base][g_~i~2#1 * 4] == 0)) could not be translated [2023-12-21 03:14:38,834 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,834 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,834 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_9 : int :: v_subst_9 <= 0 && #memory_int#2 == old(#memory_int#2)[~#pstate~0!base := old(#memory_int#2)[~#pstate~0!base][4 * v_subst_9 := #memory_int#2[~#pstate~0!base][4 * v_subst_9]]]) could not be translated [2023-12-21 03:14:38,834 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][0] could not be translated [2023-12-21 03:14:38,834 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,834 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,834 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,834 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,835 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,835 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated [2023-12-21 03:14:38,835 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,835 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,835 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,835 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,835 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,836 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,836 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated [2023-12-21 03:14:38,836 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,836 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,836 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,836 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,836 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,837 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,837 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,837 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated [2023-12-21 03:14:38,837 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,837 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,837 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,837 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,837 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated [2023-12-21 03:14:38,838 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,838 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,838 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][4] could not be translated [2023-12-21 03:14:38,838 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated [2023-12-21 03:14:38,838 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][4] could not be translated [2023-12-21 03:14:38,838 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,838 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,841 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,841 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,842 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,842 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,842 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,842 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,842 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][4] could not be translated [2023-12-21 03:14:38,842 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,842 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,843 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,843 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][4] could not be translated [2023-12-21 03:14:38,843 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,843 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.base)[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,843 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated [2023-12-21 03:14:38,843 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,843 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,843 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,843 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,843 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,844 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,844 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,844 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,844 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,844 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,844 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,844 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.base)[~#pp~0!base][4] could not be translated [2023-12-21 03:14:38,845 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][4] could not be translated [2023-12-21 03:14:38,845 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,845 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,845 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,845 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,845 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.base)[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,845 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,845 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.base)[~#pp~0!base][4] could not be translated [2023-12-21 03:14:38,845 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][4] could not be translated [2023-12-21 03:14:38,846 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,846 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,846 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,846 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,846 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][0] could not be translated [2023-12-21 03:14:38,846 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,846 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:14:38,847 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated [2023-12-21 03:14:38,847 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][4] could not be translated [2023-12-21 03:14:38,847 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,847 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated [2023-12-21 03:14:38,847 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][4] could not be translated [2023-12-21 03:14:38,848 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-12-21 03:14:38,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:14:38 BoogieIcfgContainer [2023-12-21 03:14:38,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 03:14:38,848 INFO L158 Benchmark]: Toolchain (without parser) took 207745.96ms. Allocated memory was 330.3MB in the beginning and 476.1MB in the end (delta: 145.8MB). Free memory was 278.4MB in the beginning and 332.0MB in the end (delta: -53.5MB). Peak memory consumption was 270.8MB. Max. memory is 8.0GB. [2023-12-21 03:14:38,849 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 203.4MB. Free memory is still 152.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 03:14:38,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.07ms. Allocated memory is still 330.3MB. Free memory was 278.4MB in the beginning and 267.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-21 03:14:38,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.35ms. Allocated memory is still 330.3MB. Free memory was 267.2MB in the beginning and 265.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 03:14:38,849 INFO L158 Benchmark]: Boogie Preprocessor took 73.21ms. Allocated memory is still 330.3MB. Free memory was 265.6MB in the beginning and 263.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 03:14:38,849 INFO L158 Benchmark]: RCFGBuilder took 379.22ms. Allocated memory is still 330.3MB. Free memory was 263.0MB in the beginning and 246.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-21 03:14:38,849 INFO L158 Benchmark]: TraceAbstraction took 207052.89ms. Allocated memory was 330.3MB in the beginning and 476.1MB in the end (delta: 145.8MB). Free memory was 245.9MB in the beginning and 332.0MB in the end (delta: -86.0MB). Peak memory consumption was 238.3MB. Max. memory is 8.0GB. [2023-12-21 03:14:38,850 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.25ms. Allocated memory is still 203.4MB. Free memory is still 152.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.07ms. Allocated memory is still 330.3MB. Free memory was 278.4MB in the beginning and 267.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.35ms. Allocated memory is still 330.3MB. Free memory was 267.2MB in the beginning and 265.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 73.21ms. Allocated memory is still 330.3MB. Free memory was 265.6MB in the beginning and 263.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 379.22ms. Allocated memory is still 330.3MB. Free memory was 263.0MB in the beginning and 246.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 207052.89ms. Allocated memory was 330.3MB in the beginning and 476.1MB in the end (delta: 145.8MB). Free memory was 245.9MB in the beginning and 332.0MB in the end (delta: -86.0MB). Peak memory consumption was 238.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][~i~2 * 4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_7 : int :: #memory_int#2 == old(#memory_int#2)[~#pstate~0!base := old(#memory_int#2)[~#pstate~0!base][4 * v_subst_7 := #memory_int#2[~#pstate~0!base][4 * v_subst_7]]] && v_subst_7 <= 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists g_~i~2#1 : int :: (#memory_$Pointer$#1.base[~#pp~0!base][g_~i~2#1 * 4] == #in~pointer!base && #memory_$Pointer$#1.offset[~#pp~0!base][g_~i~2#1 * 4] == #in~pointer!offset) && !(#memory_$Pointer$#1.base[~#pp~0!base][g_~i~2#1 * 4] == 0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_9 : int :: v_subst_9 <= 0 && #memory_int#2 == old(#memory_int#2)[~#pstate~0!base := old(#memory_int#2)[~#pstate~0!base][4 * v_subst_9 := #memory_int#2[~#pstate~0!base][4 * v_subst_9]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.base)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.base)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.base)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.base)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] 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: 8]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 207.0s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 184.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 72 mSolverCounterUnknown, 2801 SdHoareTripleChecker+Valid, 142.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2785 mSDsluCounter, 1361 SdHoareTripleChecker+Invalid, 141.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1084 mSDsCounter, 683 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12837 IncrementalHoareTripleChecker+Invalid, 13592 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 683 mSolverCounterUnsat, 277 mSDtfsCounter, 12837 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1690 GetRequests, 941 SyntacticMatches, 21 SemanticMatches, 728 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11414 ImplicationChecksByTransitivity, 47.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256occurred in iteration=9, InterpolantAutomatonStates: 387, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 307 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 161 PreInvPairs, 219 NumberOfFragments, 2064 HoareAnnotationTreeSize, 161 FormulaSimplifications, 28949 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 12 FormulaSimplificationsInter, 5327 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 1280 NumberOfCodeBlocks, 1279 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1694 ConstructedInterpolants, 33 QuantifiedInterpolants, 12092 SizeOfPredicates, 91 NumberOfNonLiveVariables, 4410 ConjunctsInSsa, 386 ConjunctsInUnsatCore, 43 InterpolantComputations, 6 PerfectInterpolantSequences, 580/948 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: 38]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((i == 0) && (counter == 1)) || ((1 <= i) && (counter == 1))) RESULT: Ultimate proved your program to be correct! [2023-12-21 03:14:38,888 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...