/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/array-tiling/nr3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 08:52:12,673 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 08:52:12,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 08:52:12,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 08:52:12,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 08:52:12,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 08:52:12,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 08:52:12,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 08:52:12,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 08:52:12,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 08:52:12,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 08:52:12,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 08:52:12,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 08:52:12,724 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 08:52:12,725 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 08:52:12,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 08:52:12,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 08:52:12,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 08:52:12,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 08:52:12,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 08:52:12,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 08:52:12,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 08:52:12,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 08:52:12,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 08:52:12,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 08:52:12,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 08:52:12,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 08:52:12,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 08:52:12,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 08:52:12,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 08:52:12,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 08:52:12,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 08:52:12,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 08:52:12,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 08:52:12,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 08:52:12,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 08:52:12,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 08:52:12,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 08:52:12,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 08:52:12,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 08:52:12,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 08:52:12,751 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 08:52:12,761 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 08:52:12,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 08:52:12,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 08:52:12,763 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 08:52:12,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 08:52:12,763 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 08:52:12,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 08:52:12,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 08:52:12,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 08:52:12,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 08:52:12,764 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 08:52:12,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 08:52:12,764 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 08:52:12,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 08:52:12,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 08:52:12,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 08:52:12,765 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 08:52:12,765 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 08:52:12,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 08:52:12,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 08:52:12,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 08:52:12,765 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 08:52:12,766 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 08:52:12,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 08:52:12,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 08:52:12,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 08:52:12,982 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 08:52:12,987 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 08:52:12,988 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr3.c [2022-01-31 08:52:13,041 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/573be5b8f/942982088a9b43b9b717ed1df5a6c4ed/FLAG9c42bb4a4 [2022-01-31 08:52:13,335 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 08:52:13,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr3.c [2022-01-31 08:52:13,342 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/573be5b8f/942982088a9b43b9b717ed1df5a6c4ed/FLAG9c42bb4a4 [2022-01-31 08:52:13,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/573be5b8f/942982088a9b43b9b717ed1df5a6c4ed [2022-01-31 08:52:13,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 08:52:13,772 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 08:52:13,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 08:52:13,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 08:52:13,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 08:52:13,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:52:13" (1/1) ... [2022-01-31 08:52:13,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1e3237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:52:13, skipping insertion in model container [2022-01-31 08:52:13,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:52:13" (1/1) ... [2022-01-31 08:52:13,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 08:52:13,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 08:52:13,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr3.c[394,407] [2022-01-31 08:52:13,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 08:52:13,938 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 08:52:13,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr3.c[394,407] [2022-01-31 08:52:13,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 08:52:13,959 INFO L208 MainTranslator]: Completed translation [2022-01-31 08:52:13,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:52:13 WrapperNode [2022-01-31 08:52:13,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 08:52:13,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 08:52:13,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 08:52:13,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 08:52:13,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:52:13" (1/1) ... [2022-01-31 08:52:13,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:52:13" (1/1) ... [2022-01-31 08:52:13,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:52:13" (1/1) ... [2022-01-31 08:52:13,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:52:13" (1/1) ... [2022-01-31 08:52:13,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:52:13" (1/1) ... [2022-01-31 08:52:13,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:52:13" (1/1) ... [2022-01-31 08:52:13,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:52:13" (1/1) ... [2022-01-31 08:52:13,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 08:52:13,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 08:52:13,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 08:52:13,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 08:52:13,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:52:13" (1/1) ... [2022-01-31 08:52:13,987 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 08:52:13,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 08:52:14,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 08:52:14,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 08:52:14,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 08:52:14,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 08:52:14,030 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 08:52:14,030 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 08:52:14,030 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 08:52:14,030 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 08:52:14,030 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 08:52:14,030 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 08:52:14,030 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 08:52:14,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 08:52:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 08:52:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 08:52:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 08:52:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 08:52:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 08:52:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 08:52:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 08:52:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 08:52:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 08:52:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 08:52:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 08:52:14,076 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 08:52:14,077 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 08:52:14,209 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 08:52:14,213 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 08:52:14,213 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 08:52:14,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:52:14 BoogieIcfgContainer [2022-01-31 08:52:14,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 08:52:14,215 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 08:52:14,216 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 08:52:14,216 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 08:52:14,219 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:52:14" (1/1) ... [2022-01-31 08:52:14,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 08:52:14 BasicIcfg [2022-01-31 08:52:14,234 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 08:52:14,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 08:52:14,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 08:52:14,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 08:52:14,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:52:13" (1/4) ... [2022-01-31 08:52:14,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cfe402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:52:14, skipping insertion in model container [2022-01-31 08:52:14,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:52:13" (2/4) ... [2022-01-31 08:52:14,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cfe402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:52:14, skipping insertion in model container [2022-01-31 08:52:14,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:52:14" (3/4) ... [2022-01-31 08:52:14,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cfe402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:52:14, skipping insertion in model container [2022-01-31 08:52:14,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 08:52:14" (4/4) ... [2022-01-31 08:52:14,259 INFO L111 eAbstractionObserver]: Analyzing ICFG nr3.cJordan [2022-01-31 08:52:14,263 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 08:52:14,263 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 08:52:14,316 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 08:52:14,329 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 08:52:14,330 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 08:52:14,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 08:52:14,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 08:52:14,349 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 08:52:14,350 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 08:52:14,350 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 08:52:14,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 08:52:14,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1364086043, now seen corresponding path program 1 times [2022-01-31 08:52:14,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 08:52:14,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12375321] [2022-01-31 08:52:14,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 08:52:14,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 08:52:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:14,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 08:52:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:14,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 08:52:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:14,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:52:14,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 08:52:14,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12375321] [2022-01-31 08:52:14,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12375321] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 08:52:14,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 08:52:14,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 08:52:14,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47946055] [2022-01-31 08:52:14,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 08:52:14,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 08:52:14,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 08:52:14,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 08:52:14,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 08:52:14,599 INFO L87 Difference]: Start difference. First operand has 37 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 08:52:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 08:52:14,668 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-01-31 08:52:14,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 08:52:14,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-01-31 08:52:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 08:52:14,676 INFO L225 Difference]: With dead ends: 37 [2022-01-31 08:52:14,676 INFO L226 Difference]: Without dead ends: 31 [2022-01-31 08:52:14,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 08:52:14,683 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 08:52:14,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 47 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 08:52:14,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-31 08:52:14,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-01-31 08:52:14,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 08:52:14,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-01-31 08:52:14,706 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2022-01-31 08:52:14,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 08:52:14,706 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-01-31 08:52:14,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 08:52:14,707 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-01-31 08:52:14,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 08:52:14,707 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 08:52:14,707 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 08:52:14,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 08:52:14,708 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 08:52:14,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 08:52:14,709 INFO L85 PathProgramCache]: Analyzing trace with hash 507807011, now seen corresponding path program 1 times [2022-01-31 08:52:14,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 08:52:14,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459593953] [2022-01-31 08:52:14,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 08:52:14,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 08:52:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:14,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 08:52:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:14,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 08:52:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:52:14,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 08:52:14,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459593953] [2022-01-31 08:52:14,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459593953] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 08:52:14,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 08:52:14,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 08:52:14,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296144972] [2022-01-31 08:52:14,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 08:52:14,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 08:52:14,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 08:52:14,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 08:52:14,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 08:52:14,822 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 08:52:14,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 08:52:14,922 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-01-31 08:52:14,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 08:52:14,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-01-31 08:52:14,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 08:52:14,924 INFO L225 Difference]: With dead ends: 37 [2022-01-31 08:52:14,924 INFO L226 Difference]: Without dead ends: 37 [2022-01-31 08:52:14,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-31 08:52:14,929 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 08:52:14,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 102 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 08:52:14,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-31 08:52:14,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-01-31 08:52:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 08:52:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-01-31 08:52:14,941 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2022-01-31 08:52:14,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 08:52:14,941 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-01-31 08:52:14,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 08:52:14,941 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-01-31 08:52:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 08:52:14,942 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 08:52:14,942 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 08:52:14,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 08:52:14,942 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 08:52:14,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 08:52:14,943 INFO L85 PathProgramCache]: Analyzing trace with hash 508730532, now seen corresponding path program 1 times [2022-01-31 08:52:14,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 08:52:14,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999816307] [2022-01-31 08:52:14,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 08:52:14,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 08:52:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 08:52:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:15,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 08:52:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:15,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:52:15,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 08:52:15,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999816307] [2022-01-31 08:52:15,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999816307] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 08:52:15,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 08:52:15,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 08:52:15,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339640488] [2022-01-31 08:52:15,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 08:52:15,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 08:52:15,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 08:52:15,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 08:52:15,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 08:52:15,085 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 08:52:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 08:52:15,153 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-01-31 08:52:15,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 08:52:15,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-01-31 08:52:15,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 08:52:15,157 INFO L225 Difference]: With dead ends: 41 [2022-01-31 08:52:15,157 INFO L226 Difference]: Without dead ends: 41 [2022-01-31 08:52:15,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 08:52:15,158 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 63 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 08:52:15,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 41 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 08:52:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-31 08:52:15,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-01-31 08:52:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 08:52:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-01-31 08:52:15,161 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 22 [2022-01-31 08:52:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 08:52:15,161 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-01-31 08:52:15,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 08:52:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-01-31 08:52:15,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 08:52:15,162 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 08:52:15,162 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 08:52:15,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 08:52:15,162 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 08:52:15,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 08:52:15,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1333305547, now seen corresponding path program 1 times [2022-01-31 08:52:15,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 08:52:15,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504183288] [2022-01-31 08:52:15,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 08:52:15,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 08:52:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:15,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 08:52:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:15,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 08:52:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:52:15,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 08:52:15,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504183288] [2022-01-31 08:52:15,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504183288] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 08:52:15,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 08:52:15,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 08:52:15,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636844228] [2022-01-31 08:52:15,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 08:52:15,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 08:52:15,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 08:52:15,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 08:52:15,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 08:52:15,221 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 08:52:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 08:52:15,268 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-01-31 08:52:15,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 08:52:15,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-01-31 08:52:15,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 08:52:15,269 INFO L225 Difference]: With dead ends: 40 [2022-01-31 08:52:15,269 INFO L226 Difference]: Without dead ends: 40 [2022-01-31 08:52:15,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 08:52:15,276 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 11 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 08:52:15,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 50 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 08:52:15,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-31 08:52:15,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2022-01-31 08:52:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 08:52:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-01-31 08:52:15,283 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 25 [2022-01-31 08:52:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 08:52:15,283 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-01-31 08:52:15,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 08:52:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-01-31 08:52:15,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 08:52:15,284 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 08:52:15,284 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 08:52:15,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 08:52:15,284 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 08:52:15,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 08:52:15,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1280716363, now seen corresponding path program 1 times [2022-01-31 08:52:15,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 08:52:15,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012755944] [2022-01-31 08:52:15,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 08:52:15,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 08:52:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:15,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 08:52:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:15,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 08:52:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:52:15,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 08:52:15,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012755944] [2022-01-31 08:52:15,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012755944] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 08:52:15,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869461465] [2022-01-31 08:52:15,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 08:52:15,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 08:52:15,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 08:52:15,334 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) [2022-01-31 08:52:15,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-31 08:52:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:15,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-31 08:52:15,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 08:52:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:52:15,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 08:52:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:52:15,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869461465] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 08:52:15,487 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 08:52:15,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-01-31 08:52:15,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188588284] [2022-01-31 08:52:15,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 08:52:15,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 08:52:15,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 08:52:15,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 08:52:15,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 08:52:15,488 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 08:52:15,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 08:52:15,535 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-01-31 08:52:15,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 08:52:15,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-01-31 08:52:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 08:52:15,536 INFO L225 Difference]: With dead ends: 44 [2022-01-31 08:52:15,536 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 08:52:15,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 08:52:15,537 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 08:52:15,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 84 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 08:52:15,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 08:52:15,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-01-31 08:52:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 35 states have internal predecessors, (41), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 08:52:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-01-31 08:52:15,541 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 28 [2022-01-31 08:52:15,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 08:52:15,541 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-01-31 08:52:15,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 08:52:15,541 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-01-31 08:52:15,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 08:52:15,542 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 08:52:15,542 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2022-01-31 08:52:15,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-31 08:52:15,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 08:52:15,764 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 08:52:15,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 08:52:15,764 INFO L85 PathProgramCache]: Analyzing trace with hash 343335349, now seen corresponding path program 2 times [2022-01-31 08:52:15,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 08:52:15,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902520830] [2022-01-31 08:52:15,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 08:52:15,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 08:52:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:15,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 08:52:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:15,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 08:52:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:52:15,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 08:52:15,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902520830] [2022-01-31 08:52:15,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902520830] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 08:52:15,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157596240] [2022-01-31 08:52:15,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 08:52:15,870 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 08:52:15,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 08:52:15,871 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) [2022-01-31 08:52:15,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-31 08:52:15,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 08:52:15,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 08:52:15,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-31 08:52:15,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 08:52:16,026 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:52:16,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 08:52:16,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157596240] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 08:52:16,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 08:52:16,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-01-31 08:52:16,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767920924] [2022-01-31 08:52:16,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 08:52:16,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 08:52:16,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 08:52:16,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 08:52:16,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-31 08:52:16,027 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 08:52:16,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 08:52:16,049 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-01-31 08:52:16,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 08:52:16,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-01-31 08:52:16,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 08:52:16,050 INFO L225 Difference]: With dead ends: 44 [2022-01-31 08:52:16,050 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 08:52:16,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-31 08:52:16,050 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 34 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 08:52:16,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 50 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 08:52:16,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 08:52:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-01-31 08:52:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 08:52:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-01-31 08:52:16,054 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 34 [2022-01-31 08:52:16,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 08:52:16,054 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-01-31 08:52:16,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 08:52:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-01-31 08:52:16,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 08:52:16,055 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 08:52:16,055 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 08:52:16,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 08:52:16,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-31 08:52:16,265 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 08:52:16,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 08:52:16,266 INFO L85 PathProgramCache]: Analyzing trace with hash 472418068, now seen corresponding path program 1 times [2022-01-31 08:52:16,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 08:52:16,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416684005] [2022-01-31 08:52:16,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 08:52:16,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 08:52:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:16,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 08:52:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:16,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 08:52:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:52:16,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 08:52:16,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416684005] [2022-01-31 08:52:16,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416684005] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 08:52:16,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826226434] [2022-01-31 08:52:16,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 08:52:16,626 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 08:52:16,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 08:52:16,627 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) [2022-01-31 08:52:16,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-31 08:52:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:16,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-31 08:52:16,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 08:52:16,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 14 [2022-01-31 08:52:16,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 08:52:16,861 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-01-31 08:52:16,912 INFO L353 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2022-01-31 08:52:16,913 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-01-31 08:52:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:52:17,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 08:52:33,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 51 [2022-01-31 08:52:33,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 171 treesize of output 167 [2022-01-31 08:52:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 08:52:36,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826226434] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 08:52:36,133 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 08:52:36,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 13] total 36 [2022-01-31 08:52:36,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358608005] [2022-01-31 08:52:36,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 08:52:36,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-31 08:52:36,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 08:52:36,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-31 08:52:36,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1071, Unknown=4, NotChecked=0, Total=1260 [2022-01-31 08:52:36,134 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 36 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 33 states have internal predecessors, (68), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 08:52:38,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 08:52:38,599 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2022-01-31 08:52:38,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 08:52:38,600 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 33 states have internal predecessors, (68), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-01-31 08:52:38,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 08:52:38,602 INFO L225 Difference]: With dead ends: 87 [2022-01-31 08:52:38,602 INFO L226 Difference]: Without dead ends: 87 [2022-01-31 08:52:38,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=356, Invalid=1895, Unknown=5, NotChecked=0, Total=2256 [2022-01-31 08:52:38,603 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 45 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 08:52:38,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 255 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 373 Invalid, 0 Unknown, 147 Unchecked, 0.2s Time] [2022-01-31 08:52:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-31 08:52:38,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 64. [2022-01-31 08:52:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 55 states have internal predecessors, (66), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 08:52:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-01-31 08:52:38,609 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 34 [2022-01-31 08:52:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 08:52:38,609 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-01-31 08:52:38,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 33 states have internal predecessors, (68), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 08:52:38,609 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-01-31 08:52:38,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 08:52:38,611 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 08:52:38,612 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 08:52:38,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-31 08:52:38,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 08:52:38,823 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 08:52:38,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 08:52:38,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1715135091, now seen corresponding path program 1 times [2022-01-31 08:52:38,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 08:52:38,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428152257] [2022-01-31 08:52:38,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 08:52:38,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 08:52:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:39,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 08:52:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:39,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 08:52:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:39,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 08:52:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:52:39,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 08:52:39,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428152257] [2022-01-31 08:52:39,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428152257] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 08:52:39,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086052689] [2022-01-31 08:52:39,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 08:52:39,066 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 08:52:39,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 08:52:39,067 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) [2022-01-31 08:52:39,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-31 08:52:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:39,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-31 08:52:39,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 08:52:39,217 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-01-31 08:52:39,275 INFO L353 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-01-31 08:52:39,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 31 [2022-01-31 08:52:39,747 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:52:39,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 08:52:42,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 35 [2022-01-31 08:52:42,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 75 treesize of output 67 [2022-01-31 08:52:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 08:52:43,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086052689] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 08:52:43,092 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 08:52:43,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 34 [2022-01-31 08:52:43,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295891617] [2022-01-31 08:52:43,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 08:52:43,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-31 08:52:43,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 08:52:43,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-31 08:52:43,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 08:52:43,094 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 34 states, 33 states have (on average 2.606060606060606) internal successors, (86), 32 states have internal predecessors, (86), 9 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 08:52:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 08:52:43,523 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2022-01-31 08:52:43,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 08:52:43,523 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.606060606060606) internal successors, (86), 32 states have internal predecessors, (86), 9 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 43 [2022-01-31 08:52:43,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 08:52:43,524 INFO L225 Difference]: With dead ends: 121 [2022-01-31 08:52:43,524 INFO L226 Difference]: Without dead ends: 121 [2022-01-31 08:52:43,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=287, Invalid=1875, Unknown=0, NotChecked=0, Total=2162 [2022-01-31 08:52:43,526 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 90 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 08:52:43,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 281 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 321 Invalid, 0 Unknown, 211 Unchecked, 0.1s Time] [2022-01-31 08:52:43,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-31 08:52:43,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2022-01-31 08:52:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.202247191011236) internal successors, (107), 92 states have internal predecessors, (107), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-31 08:52:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2022-01-31 08:52:43,533 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 43 [2022-01-31 08:52:43,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 08:52:43,534 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2022-01-31 08:52:43,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.606060606060606) internal successors, (86), 32 states have internal predecessors, (86), 9 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 08:52:43,534 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2022-01-31 08:52:43,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 08:52:43,535 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 08:52:43,535 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1] [2022-01-31 08:52:43,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-31 08:52:43,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 08:52:43,747 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 08:52:43,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 08:52:43,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2074273580, now seen corresponding path program 1 times [2022-01-31 08:52:43,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 08:52:43,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153198822] [2022-01-31 08:52:43,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 08:52:43,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 08:52:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:44,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 08:52:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:44,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 08:52:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:44,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 08:52:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:44,023 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:52:44,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 08:52:44,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153198822] [2022-01-31 08:52:44,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153198822] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 08:52:44,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051428873] [2022-01-31 08:52:44,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 08:52:44,024 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 08:52:44,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 08:52:44,025 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) [2022-01-31 08:52:44,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-31 08:52:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:52:44,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-31 08:52:44,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 08:52:44,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 14 [2022-01-31 08:52:44,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 08:52:44,185 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-01-31 08:52:44,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 08:52:44,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 23 [2022-01-31 08:52:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:52:44,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 08:53:05,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 36 [2022-01-31 08:53:05,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 880 treesize of output 872 [2022-01-31 08:53:05,393 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 12 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:53:05,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051428873] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 08:53:05,393 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 08:53:05,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2022-01-31 08:53:05,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102881178] [2022-01-31 08:53:05,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 08:53:05,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-31 08:53:05,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 08:53:05,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-31 08:53:05,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=888, Unknown=12, NotChecked=0, Total=1056 [2022-01-31 08:53:05,396 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand has 33 states, 32 states have (on average 2.59375) internal successors, (83), 32 states have internal predecessors, (83), 6 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-31 08:53:05,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 08:53:05,824 INFO L93 Difference]: Finished difference Result 142 states and 171 transitions. [2022-01-31 08:53:05,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 08:53:05,825 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.59375) internal successors, (83), 32 states have internal predecessors, (83), 6 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2022-01-31 08:53:05,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 08:53:05,825 INFO L225 Difference]: With dead ends: 142 [2022-01-31 08:53:05,825 INFO L226 Difference]: Without dead ends: 141 [2022-01-31 08:53:05,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=306, Invalid=1662, Unknown=12, NotChecked=0, Total=1980 [2022-01-31 08:53:05,826 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 96 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 214 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 08:53:05,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 221 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 489 Invalid, 0 Unknown, 214 Unchecked, 0.2s Time] [2022-01-31 08:53:05,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-01-31 08:53:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2022-01-31 08:53:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 104 states have internal predecessors, (119), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-31 08:53:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2022-01-31 08:53:05,847 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 43 [2022-01-31 08:53:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 08:53:05,848 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2022-01-31 08:53:05,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.59375) internal successors, (83), 32 states have internal predecessors, (83), 6 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-31 08:53:05,848 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2022-01-31 08:53:05,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 08:53:05,849 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 08:53:05,849 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 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] [2022-01-31 08:53:05,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-31 08:53:06,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 08:53:06,061 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 08:53:06,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 08:53:06,062 INFO L85 PathProgramCache]: Analyzing trace with hash 532826500, now seen corresponding path program 2 times [2022-01-31 08:53:06,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 08:53:06,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346799305] [2022-01-31 08:53:06,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 08:53:06,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 08:53:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:53:06,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 08:53:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:53:06,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 08:53:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:53:06,510 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:53:06,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 08:53:06,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346799305] [2022-01-31 08:53:06,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346799305] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 08:53:06,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374869392] [2022-01-31 08:53:06,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 08:53:06,511 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 08:53:06,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 08:53:06,512 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) [2022-01-31 08:53:06,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-31 08:53:06,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 08:53:06,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 08:53:06,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-31 08:53:06,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 08:53:06,646 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 14 [2022-01-31 08:53:06,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 08:53:06,706 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-01-31 08:53:06,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 08:53:06,762 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-01-31 08:53:06,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 08:53:06,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 25 [2022-01-31 08:53:06,898 INFO L353 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2022-01-31 08:53:06,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 33 [2022-01-31 08:53:06,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 08:53:06,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 33 [2022-01-31 08:53:07,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-01-31 08:53:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:53:07,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 08:53:08,300 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_135 Int) (main_~j~0 Int) (v_ArrVal_133 Int) (v_main_~j~0_36 Int)) (or (<= c_main_~MINVAL~0 (select (let ((.cse0 (* c_main_~i~0 12))) (store (store (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ .cse0 (* main_~j~0 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_133) (+ (* v_main_~j~0_36 (- 4)) .cse0 |c_main_~#volArray~0.offset|) v_ArrVal_135)) |c_main_~#volArray~0.offset|)) (<= c_main_~MINVAL~0 v_main_~j~0_36) (not (<= main_~j~0 (+ v_main_~j~0_36 1))))) is different from false [2022-01-31 08:53:13,438 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~j~0_39 Int)) (or (not (<= v_main_~j~0_39 3)) (forall ((v_main_~j~0_38 Int) (v_ArrVal_135 Int) (v_ArrVal_133 Int) (v_ArrVal_132 Int) (v_main_~j~0_36 Int)) (or (not (<= v_main_~j~0_38 (+ v_main_~j~0_36 1))) (<= c_main_~MINVAL~0 v_main_~j~0_36) (<= c_main_~MINVAL~0 (select (let ((.cse0 (* c_main_~i~0 12))) (store (store (store (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ .cse0 (* v_main_~j~0_39 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_132) (+ .cse0 (* v_main_~j~0_38 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_133) (+ (* v_main_~j~0_36 (- 4)) .cse0 |c_main_~#volArray~0.offset|) v_ArrVal_135)) |c_main_~#volArray~0.offset|)))))) is different from false [2022-01-31 08:53:42,767 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~j~0_41 Int)) (or (not (<= (+ v_main_~j~0_41 1) c_main_~j~0)) (forall ((v_main_~j~0_39 Int) (v_ArrVal_130 Int) (v_main_~i~0_34 Int)) (or (not (<= v_main_~j~0_39 3)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_34)) (forall ((v_main_~j~0_38 Int) (v_ArrVal_135 Int) (v_ArrVal_133 Int) (v_ArrVal_132 Int) (v_main_~j~0_36 Int)) (or (not (<= v_main_~j~0_38 (+ v_main_~j~0_36 1))) (<= c_main_~MINVAL~0 v_main_~j~0_36) (<= c_main_~MINVAL~0 (select (let ((.cse0 (* v_main_~i~0_34 12))) (store (store (store (store (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ (* c_main_~i~0 12) (* v_main_~j~0_41 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_130) (+ .cse0 (* v_main_~j~0_39 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_132) (+ .cse0 (* v_main_~j~0_38 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_133) (+ (* v_main_~j~0_36 (- 4)) .cse0 |c_main_~#volArray~0.offset|) v_ArrVal_135)) |c_main_~#volArray~0.offset|)))))))) is different from false [2022-01-31 08:54:09,327 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~j~0_42 Int)) (or (forall ((v_main_~j~0_39 Int) (v_ArrVal_130 Int) (v_main_~i~0_34 Int) (v_main_~j~0_41 Int) (v_ArrVal_127 Int)) (or (not (<= v_main_~j~0_39 3)) (forall ((v_main_~j~0_38 Int) (v_ArrVal_135 Int) (v_ArrVal_133 Int) (v_ArrVal_132 Int) (v_main_~j~0_36 Int)) (or (<= c_main_~MINVAL~0 (select (let ((.cse1 (* v_main_~i~0_34 12))) (store (store (store (let ((.cse0 (* c_main_~i~0 12))) (store (store (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ .cse0 |c_main_~#volArray~0.offset| (* v_main_~j~0_42 (- 4))) v_ArrVal_127) (+ .cse0 (* v_main_~j~0_41 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_130)) (+ .cse1 (* v_main_~j~0_39 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_132) (+ .cse1 (* v_main_~j~0_38 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_133) (+ (* v_main_~j~0_36 (- 4)) .cse1 |c_main_~#volArray~0.offset|) v_ArrVal_135)) |c_main_~#volArray~0.offset|)) (not (<= v_main_~j~0_38 (+ v_main_~j~0_36 1))) (<= c_main_~MINVAL~0 v_main_~j~0_36))) (not (<= (+ v_main_~j~0_41 1) v_main_~j~0_42)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_34)))) (not (<= (+ v_main_~j~0_42 1) c_main_~j~0)))) is different from false [2022-01-31 08:54:09,348 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 67 treesize of output 65 [2022-01-31 08:54:09,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 6896 treesize of output 6888 [2022-01-31 08:54:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2022-01-31 08:54:11,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374869392] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 08:54:11,987 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 08:54:11,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 18] total 50 [2022-01-31 08:54:11,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650522771] [2022-01-31 08:54:11,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 08:54:11,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-31 08:54:11,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 08:54:11,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-31 08:54:11,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1702, Unknown=27, NotChecked=364, Total=2450 [2022-01-31 08:54:11,991 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand has 50 states, 50 states have (on average 2.08) internal successors, (104), 48 states have internal predecessors, (104), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 08:54:14,064 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (+ (- 1) c_main_~i~0)) (= (+ (- 3) c_main_~j~0) 0) (= |c_main_~#volArray~0.offset| 0) (= 2 c_main_~MINVAL~0) (forall ((v_main_~j~0_42 Int)) (or (forall ((v_main_~j~0_39 Int) (v_ArrVal_130 Int) (v_main_~i~0_34 Int) (v_main_~j~0_41 Int) (v_ArrVal_127 Int)) (or (not (<= v_main_~j~0_39 3)) (forall ((v_main_~j~0_38 Int) (v_ArrVal_135 Int) (v_ArrVal_133 Int) (v_ArrVal_132 Int) (v_main_~j~0_36 Int)) (or (<= c_main_~MINVAL~0 (select (let ((.cse1 (* v_main_~i~0_34 12))) (store (store (store (let ((.cse0 (* c_main_~i~0 12))) (store (store (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ .cse0 |c_main_~#volArray~0.offset| (* v_main_~j~0_42 (- 4))) v_ArrVal_127) (+ .cse0 (* v_main_~j~0_41 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_130)) (+ .cse1 (* v_main_~j~0_39 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_132) (+ .cse1 (* v_main_~j~0_38 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_133) (+ (* v_main_~j~0_36 (- 4)) .cse1 |c_main_~#volArray~0.offset|) v_ArrVal_135)) |c_main_~#volArray~0.offset|)) (not (<= v_main_~j~0_38 (+ v_main_~j~0_36 1))) (<= c_main_~MINVAL~0 v_main_~j~0_36))) (not (<= (+ v_main_~j~0_41 1) v_main_~j~0_42)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_34)))) (not (<= (+ v_main_~j~0_42 1) c_main_~j~0)))) (= (select (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ (* c_main_~i~0 12) (* (- 4) c_main_~j~0) |c_main_~#volArray~0.offset|)) c_main_~j~0)) is different from false [2022-01-31 08:54:16,078 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#volArray~0.base|))) (and (<= c_main_~MINVAL~0 (select .cse0 (+ (* c_main_~i~0 4) |c_main_~#volArray~0.offset|))) (= 0 (+ (- 1) c_main_~i~0)) (forall ((v_main_~j~0_41 Int)) (or (not (<= (+ v_main_~j~0_41 1) c_main_~j~0)) (forall ((v_main_~j~0_39 Int) (v_ArrVal_130 Int) (v_main_~i~0_34 Int)) (or (not (<= v_main_~j~0_39 3)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_34)) (forall ((v_main_~j~0_38 Int) (v_ArrVal_135 Int) (v_ArrVal_133 Int) (v_ArrVal_132 Int) (v_main_~j~0_36 Int)) (or (not (<= v_main_~j~0_38 (+ v_main_~j~0_36 1))) (<= c_main_~MINVAL~0 v_main_~j~0_36) (<= c_main_~MINVAL~0 (select (let ((.cse1 (* v_main_~i~0_34 12))) (store (store (store (store (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ (* c_main_~i~0 12) (* v_main_~j~0_41 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_130) (+ .cse1 (* v_main_~j~0_39 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_132) (+ .cse1 (* v_main_~j~0_38 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_133) (+ (* v_main_~j~0_36 (- 4)) .cse1 |c_main_~#volArray~0.offset|) v_ArrVal_135)) |c_main_~#volArray~0.offset|)))))))) (= |c_main_~#volArray~0.offset| 0) (<= (+ c_main_~j~0 1) (div (+ (* c_main_~i~0 12) |c_main_~#volArray~0.offset|) 4)) (= 2 c_main_~MINVAL~0) (forall ((v_ArrVal_135 Int) (main_~j~0 Int) (v_ArrVal_133 Int) (v_main_~j~0_36 Int)) (or (<= c_main_~MINVAL~0 (select (let ((.cse2 (* c_main_~i~0 12))) (store (store (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ .cse2 (* main_~j~0 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_133) (+ (* v_main_~j~0_36 (- 4)) .cse2 |c_main_~#volArray~0.offset|) v_ArrVal_135)) |c_main_~#volArray~0.offset|)) (<= c_main_~MINVAL~0 v_main_~j~0_36) (not (<= main_~j~0 (+ v_main_~j~0_36 1))))) (<= 3 (select .cse0 0)))) is different from false [2022-01-31 08:54:16,535 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~i~0 12)) (.cse1 (select |c_#memory_int| |c_main_~#volArray~0.base|))) (and (<= c_main_~j~0 1) (not (= (+ .cse0 |c_main_~#volArray~0.offset|) (* c_main_~j~0 4))) (= 0 (+ (- 1) c_main_~i~0)) (<= c_main_~MINVAL~0 2) (= |c_main_~#volArray~0.offset| 0) (= 2 c_main_~MINVAL~0) (<= 3 (select .cse1 (+ .cse0 (- 12) |c_main_~#volArray~0.offset|))) (forall ((v_ArrVal_135 Int) (main_~j~0 Int) (v_ArrVal_133 Int) (v_main_~j~0_36 Int)) (or (<= c_main_~MINVAL~0 (select (let ((.cse2 (* c_main_~i~0 12))) (store (store (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ .cse2 (* main_~j~0 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_133) (+ (* v_main_~j~0_36 (- 4)) .cse2 |c_main_~#volArray~0.offset|) v_ArrVal_135)) |c_main_~#volArray~0.offset|)) (<= c_main_~MINVAL~0 v_main_~j~0_36) (not (<= main_~j~0 (+ v_main_~j~0_36 1))))) (<= 3 (select .cse1 0)) (= c_main_~i~0 1))) is different from false [2022-01-31 08:54:18,574 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~j~0_39 Int)) (or (not (<= v_main_~j~0_39 3)) (forall ((v_main_~j~0_38 Int) (v_ArrVal_135 Int) (v_ArrVal_133 Int) (v_ArrVal_132 Int) (v_main_~j~0_36 Int)) (or (not (<= v_main_~j~0_38 (+ v_main_~j~0_36 1))) (<= c_main_~MINVAL~0 v_main_~j~0_36) (<= c_main_~MINVAL~0 (select (let ((.cse0 (* c_main_~i~0 12))) (store (store (store (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ .cse0 (* v_main_~j~0_39 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_132) (+ .cse0 (* v_main_~j~0_38 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_133) (+ (* v_main_~j~0_36 (- 4)) .cse0 |c_main_~#volArray~0.offset|) v_ArrVal_135)) |c_main_~#volArray~0.offset|)))))) (= |c_main_~#volArray~0.offset| 0) (= 2 c_main_~MINVAL~0) (<= (+ (div (* (- 1) |c_main_~#volArray~0.offset|) 4) 6) (* c_main_~i~0 3)) (<= 3 (select (select |c_#memory_int| |c_main_~#volArray~0.base|) 0)) (not (= (+ (* c_main_~i~0 12) (* (- 4) c_main_~j~0) |c_main_~#volArray~0.offset|) 0)) (= (+ (- 2) c_main_~MINVAL~0) 0)) is different from false [2022-01-31 08:54:20,681 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (- 3) c_main_~j~0) 0) (forall ((v_main_~j~0_41 Int)) (or (not (<= (+ v_main_~j~0_41 1) c_main_~j~0)) (forall ((v_main_~j~0_39 Int) (v_ArrVal_130 Int) (v_main_~i~0_34 Int)) (or (not (<= v_main_~j~0_39 3)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_34)) (forall ((v_main_~j~0_38 Int) (v_ArrVal_135 Int) (v_ArrVal_133 Int) (v_ArrVal_132 Int) (v_main_~j~0_36 Int)) (or (not (<= v_main_~j~0_38 (+ v_main_~j~0_36 1))) (<= c_main_~MINVAL~0 v_main_~j~0_36) (<= c_main_~MINVAL~0 (select (let ((.cse0 (* v_main_~i~0_34 12))) (store (store (store (store (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ (* c_main_~i~0 12) (* v_main_~j~0_41 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_130) (+ .cse0 (* v_main_~j~0_39 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_132) (+ .cse0 (* v_main_~j~0_38 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_133) (+ (* v_main_~j~0_36 (- 4)) .cse0 |c_main_~#volArray~0.offset|) v_ArrVal_135)) |c_main_~#volArray~0.offset|)))))))) (= |c_main_~#volArray~0.offset| 0) (= 2 c_main_~MINVAL~0) (<= (+ (div (* (- 1) |c_main_~#volArray~0.offset|) 4) 6) (* c_main_~i~0 3)) (forall ((v_ArrVal_135 Int) (main_~j~0 Int) (v_ArrVal_133 Int) (v_main_~j~0_36 Int)) (or (<= c_main_~MINVAL~0 (select (let ((.cse1 (* c_main_~i~0 12))) (store (store (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ .cse1 (* main_~j~0 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_133) (+ (* v_main_~j~0_36 (- 4)) .cse1 |c_main_~#volArray~0.offset|) v_ArrVal_135)) |c_main_~#volArray~0.offset|)) (<= c_main_~MINVAL~0 v_main_~j~0_36) (not (<= main_~j~0 (+ v_main_~j~0_36 1))))) (<= 3 (select (select |c_#memory_int| |c_main_~#volArray~0.base|) 0))) is different from false [2022-01-31 08:54:21,445 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_main_~#volArray~0.base|))) (and (forall ((v_main_~j~0_39 Int) (v_ArrVal_130 Int) (v_main_~i~0_34 Int)) (or (forall ((v_main_~j~0_38 Int) (v_ArrVal_135 Int) (v_ArrVal_133 Int) (v_ArrVal_132 Int) (v_main_~j~0_36 Int)) (or (not (<= v_main_~j~0_38 (+ v_main_~j~0_36 1))) (<= c_main_~MINVAL~0 v_main_~j~0_36) (<= c_main_~MINVAL~0 (select (let ((.cse0 (* v_main_~i~0_34 12))) (store (store (store (store (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ (* c_main_~i~0 12) (* (- 4) c_main_~j~0) |c_main_~#volArray~0.offset|) v_ArrVal_130) (+ .cse0 (* v_main_~j~0_39 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_132) (+ .cse0 (* v_main_~j~0_38 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_133) (+ (* v_main_~j~0_36 (- 4)) .cse0 |c_main_~#volArray~0.offset|) v_ArrVal_135)) |c_main_~#volArray~0.offset|)))) (not (<= v_main_~j~0_39 3)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_34)))) (<= 2 c_main_~i~0) (<= 3 (select .cse1 |c_main_~#volArray~0.offset|)) (<= c_main_~MINVAL~0 2) (= |c_main_~#volArray~0.offset| 0) (forall ((v_ArrVal_135 Int) (main_~j~0 Int) (v_ArrVal_133 Int) (v_main_~j~0_36 Int)) (or (<= c_main_~MINVAL~0 (select (let ((.cse2 (* c_main_~i~0 12))) (store (store (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ .cse2 (* main_~j~0 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_133) (+ (* v_main_~j~0_36 (- 4)) .cse2 |c_main_~#volArray~0.offset|) v_ArrVal_135)) |c_main_~#volArray~0.offset|)) (<= c_main_~MINVAL~0 v_main_~j~0_36) (not (<= main_~j~0 (+ v_main_~j~0_36 1))))) (<= 3 (select .cse1 0)) (not (= (+ (* c_main_~i~0 12) (* (- 4) c_main_~j~0) |c_main_~#volArray~0.offset|) 0)) (= (+ (- 2) c_main_~MINVAL~0) 0))) is different from false [2022-01-31 08:54:23,491 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_main_~#volArray~0.base|))) (and (or (let ((.cse0 (+ (* c_main_~i~0 12) (* (- 4) c_main_~j~0) |c_main_~#volArray~0.offset|))) (and (= .cse0 0) (= (select .cse1 .cse0) 0))) (and (<= 3 (select .cse1 0)) (= (+ (- 2) c_main_~MINVAL~0) 0))) (<= 3 (select .cse1 |c_main_~#volArray~0.offset|)) (<= c_main_~MINVAL~0 2) (= |c_main_~#volArray~0.offset| 0) (forall ((v_main_~i~0_34 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_34)) (forall ((v_main_~j~0_39 Int)) (or (forall ((v_main_~j~0_38 Int) (v_ArrVal_135 Int) (v_ArrVal_133 Int) (v_ArrVal_132 Int) (v_main_~j~0_36 Int)) (or (not (<= v_main_~j~0_38 (+ v_main_~j~0_36 1))) (<= c_main_~MINVAL~0 v_main_~j~0_36) (<= c_main_~MINVAL~0 (select (let ((.cse2 (* v_main_~i~0_34 12))) (store (store (store (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ .cse2 (* v_main_~j~0_39 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_132) (+ .cse2 (* v_main_~j~0_38 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_133) (+ (* v_main_~j~0_36 (- 4)) .cse2 |c_main_~#volArray~0.offset|) v_ArrVal_135)) |c_main_~#volArray~0.offset|)))) (not (<= v_main_~j~0_39 3)))))))) is different from false [2022-01-31 08:54:25,505 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#volArray~0.base|))) (and (<= 3 (select .cse0 |c_main_~#volArray~0.offset|)) (<= c_main_~MINVAL~0 2) (= |c_main_~#volArray~0.offset| 0) (let ((.cse1 (select .cse0 0))) (or (and (<= 3 .cse1) (= (+ (- 2) c_main_~MINVAL~0) 0)) (= 0 .cse1))) (forall ((v_main_~i~0_34 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_34)) (forall ((v_main_~j~0_39 Int)) (or (forall ((v_main_~j~0_38 Int) (v_ArrVal_135 Int) (v_ArrVal_133 Int) (v_ArrVal_132 Int) (v_main_~j~0_36 Int)) (or (not (<= v_main_~j~0_38 (+ v_main_~j~0_36 1))) (<= c_main_~MINVAL~0 v_main_~j~0_36) (<= c_main_~MINVAL~0 (select (let ((.cse2 (* v_main_~i~0_34 12))) (store (store (store (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ .cse2 (* v_main_~j~0_39 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_132) (+ .cse2 (* v_main_~j~0_38 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_133) (+ (* v_main_~j~0_36 (- 4)) .cse2 |c_main_~#volArray~0.offset|) v_ArrVal_135)) |c_main_~#volArray~0.offset|)))) (not (<= v_main_~j~0_39 3)))))))) is different from false [2022-01-31 08:54:27,649 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#volArray~0.base|))) (and (<= c_main_~MINVAL~0 (select .cse0 |c_main_~#volArray~0.offset|)) (forall ((v_main_~j~0_36 Int)) (or (not (<= c_main_~j~0 (+ v_main_~j~0_36 1))) (forall ((v_ArrVal_135 Int)) (<= c_main_~MINVAL~0 (select (store (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ (* v_main_~j~0_36 (- 4)) (* c_main_~i~0 12) |c_main_~#volArray~0.offset|) v_ArrVal_135) |c_main_~#volArray~0.offset|))) (<= c_main_~MINVAL~0 v_main_~j~0_36))) (<= c_main_~MINVAL~0 2) (= |c_main_~#volArray~0.offset| 0) (let ((.cse1 (select .cse0 0))) (or (and (<= 3 .cse1) (= (+ (- 2) c_main_~MINVAL~0) 0)) (= 0 .cse1))) (forall ((v_main_~i~0_34 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_34)) (forall ((v_main_~j~0_39 Int)) (or (forall ((v_main_~j~0_38 Int) (v_ArrVal_135 Int) (v_ArrVal_133 Int) (v_ArrVal_132 Int) (v_main_~j~0_36 Int)) (or (not (<= v_main_~j~0_38 (+ v_main_~j~0_36 1))) (<= c_main_~MINVAL~0 v_main_~j~0_36) (<= c_main_~MINVAL~0 (select (let ((.cse2 (* v_main_~i~0_34 12))) (store (store (store (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ .cse2 (* v_main_~j~0_39 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_132) (+ .cse2 (* v_main_~j~0_38 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_133) (+ (* v_main_~j~0_36 (- 4)) .cse2 |c_main_~#volArray~0.offset|) v_ArrVal_135)) |c_main_~#volArray~0.offset|)))) (not (<= v_main_~j~0_39 3)))))) (= c_main_~i~0 1))) is different from false [2022-01-31 08:54:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 08:54:28,055 INFO L93 Difference]: Finished difference Result 188 states and 224 transitions. [2022-01-31 08:54:28,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-31 08:54:28,056 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 48 states have internal predecessors, (104), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2022-01-31 08:54:28,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 08:54:28,057 INFO L225 Difference]: With dead ends: 188 [2022-01-31 08:54:28,057 INFO L226 Difference]: Without dead ends: 188 [2022-01-31 08:54:28,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 72 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1644 ImplicationChecksByTransitivity, 77.1s TimeCoverageRelationStatistics Valid=595, Invalid=3453, Unknown=36, NotChecked=1768, Total=5852 [2022-01-31 08:54:28,058 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 159 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 518 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 08:54:28,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 337 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 645 Invalid, 0 Unknown, 518 Unchecked, 0.3s Time] [2022-01-31 08:54:28,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-01-31 08:54:28,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 139. [2022-01-31 08:54:28,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 120 states have (on average 1.2) internal successors, (144), 125 states have internal predecessors, (144), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 5 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-31 08:54:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 165 transitions. [2022-01-31 08:54:28,065 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 165 transitions. Word has length 46 [2022-01-31 08:54:28,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 08:54:28,065 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 165 transitions. [2022-01-31 08:54:28,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 48 states have internal predecessors, (104), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 08:54:28,065 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 165 transitions. [2022-01-31 08:54:28,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 08:54:28,068 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 08:54:28,068 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 08:54:28,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-31 08:54:28,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 08:54:28,276 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 08:54:28,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 08:54:28,276 INFO L85 PathProgramCache]: Analyzing trace with hash 2040378309, now seen corresponding path program 3 times [2022-01-31 08:54:28,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 08:54:28,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751177728] [2022-01-31 08:54:28,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 08:54:28,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 08:54:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:54:28,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 08:54:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:54:28,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 08:54:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:54:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-01-31 08:54:28,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 08:54:28,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751177728] [2022-01-31 08:54:28,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751177728] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 08:54:28,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 08:54:28,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 08:54:28,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680034965] [2022-01-31 08:54:28,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 08:54:28,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 08:54:28,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 08:54:28,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 08:54:28,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 08:54:28,348 INFO L87 Difference]: Start difference. First operand 139 states and 165 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 08:54:28,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 08:54:28,383 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2022-01-31 08:54:28,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 08:54:28,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-01-31 08:54:28,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 08:54:28,384 INFO L225 Difference]: With dead ends: 104 [2022-01-31 08:54:28,384 INFO L226 Difference]: Without dead ends: 96 [2022-01-31 08:54:28,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 08:54:28,385 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 08:54:28,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 52 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 08:54:28,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-01-31 08:54:28,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2022-01-31 08:54:28,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 70 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 08:54:28,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-01-31 08:54:28,388 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 46 [2022-01-31 08:54:28,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 08:54:28,388 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-01-31 08:54:28,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 08:54:28,388 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-01-31 08:54:28,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 08:54:28,388 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 08:54:28,388 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2022-01-31 08:54:28,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 08:54:28,389 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 08:54:28,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 08:54:28,389 INFO L85 PathProgramCache]: Analyzing trace with hash 715636532, now seen corresponding path program 2 times [2022-01-31 08:54:28,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 08:54:28,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819255628] [2022-01-31 08:54:28,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 08:54:28,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 08:54:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:54:28,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 08:54:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:54:28,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 08:54:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:54:28,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 08:54:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:54:28,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 08:54:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:54:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 08:54:28,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 08:54:28,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819255628] [2022-01-31 08:54:28,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819255628] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 08:54:28,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326363803] [2022-01-31 08:54:28,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 08:54:28,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 08:54:28,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 08:54:28,547 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) [2022-01-31 08:54:28,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-31 08:54:28,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 08:54:28,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 08:54:28,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-31 08:54:28,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 08:54:28,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-01-31 08:54:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 08:54:33,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 08:54:35,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2022-01-31 08:54:35,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 30 [2022-01-31 08:54:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 08:54:35,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326363803] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 08:54:35,694 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 08:54:35,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 14] total 27 [2022-01-31 08:54:35,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196270247] [2022-01-31 08:54:35,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 08:54:35,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 08:54:35,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 08:54:35,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 08:54:35,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=597, Unknown=3, NotChecked=0, Total=702 [2022-01-31 08:54:35,695 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 27 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 24 states have internal predecessors, (74), 6 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-31 08:54:36,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 08:54:36,046 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-01-31 08:54:36,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 08:54:36,047 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 24 states have internal predecessors, (74), 6 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 52 [2022-01-31 08:54:36,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 08:54:36,048 INFO L225 Difference]: With dead ends: 104 [2022-01-31 08:54:36,048 INFO L226 Difference]: Without dead ends: 104 [2022-01-31 08:54:36,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 96 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=186, Invalid=1217, Unknown=3, NotChecked=0, Total=1406 [2022-01-31 08:54:36,049 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 57 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 08:54:36,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 255 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 371 Invalid, 0 Unknown, 35 Unchecked, 0.2s Time] [2022-01-31 08:54:36,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-01-31 08:54:36,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2022-01-31 08:54:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 1.075) internal successors, (86), 81 states have internal predecessors, (86), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 08:54:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2022-01-31 08:54:36,052 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 52 [2022-01-31 08:54:36,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 08:54:36,052 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2022-01-31 08:54:36,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 24 states have internal predecessors, (74), 6 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-31 08:54:36,052 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2022-01-31 08:54:36,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 08:54:36,053 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 08:54:36,053 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 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] [2022-01-31 08:54:36,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-31 08:54:36,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 08:54:36,260 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 08:54:36,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 08:54:36,260 INFO L85 PathProgramCache]: Analyzing trace with hash 438769949, now seen corresponding path program 3 times [2022-01-31 08:54:36,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 08:54:36,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492560831] [2022-01-31 08:54:36,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 08:54:36,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 08:54:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:54:36,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 08:54:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:54:36,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 08:54:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:54:36,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 08:54:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 08:54:36,747 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:54:36,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 08:54:36,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492560831] [2022-01-31 08:54:36,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492560831] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 08:54:36,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146885020] [2022-01-31 08:54:36,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 08:54:36,748 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 08:54:36,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 08:54:36,752 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) [2022-01-31 08:54:36,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-31 08:54:36,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-01-31 08:54:36,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 08:54:36,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 42 conjunts are in the unsatisfiable core [2022-01-31 08:54:36,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 08:54:36,952 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-01-31 08:54:37,001 INFO L353 Elim1Store]: treesize reduction 40, result has 31.0 percent of original size [2022-01-31 08:54:37,001 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-01-31 08:54:37,129 INFO L353 Elim1Store]: treesize reduction 27, result has 41.3 percent of original size [2022-01-31 08:54:37,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 37 [2022-01-31 08:54:37,230 INFO L353 Elim1Store]: treesize reduction 27, result has 41.3 percent of original size [2022-01-31 08:54:37,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 45 [2022-01-31 08:54:37,305 INFO L353 Elim1Store]: treesize reduction 27, result has 41.3 percent of original size [2022-01-31 08:54:37,305 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 45 [2022-01-31 08:54:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 08:54:39,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 08:54:46,381 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_202 Int) (main_~j~0 Int) (v_main_~j~0_58 Int) (v_main_~j~0_57 Int) (v_ArrVal_204 Int)) (let ((.cse0 (select (let ((.cse1 (* c_main_~i~0 12))) (store (store (store (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ .cse1 (* main_~j~0 (- 4)) |c_main_~#volArray~0.offset|) v_ArrVal_202) (+ .cse1 |c_main_~#volArray~0.offset| (* v_main_~j~0_58 (- 4))) v_ArrVal_204) (+ .cse1 (* v_main_~j~0_57 (- 4)) |c_main_~#volArray~0.offset|) 0)) (+ |c_main_~#volArray~0.offset| 4)))) (or (not (<= v_main_~j~0_58 (+ v_main_~j~0_57 1))) (<= c_main_~MINVAL~0 .cse0) (not (<= main_~j~0 (+ v_main_~j~0_58 1))) (<= 2 v_main_~j~0_57) (= .cse0 0)))) is different from false [2022-01-31 08:56:14,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 119 treesize of output 115 [2022-01-31 08:56:14,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 116423 treesize of output 115911