/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-fpi/s4lif.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 11:45:31,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 11:45:31,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 11:45:31,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 11:45:31,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 11:45:31,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 11:45:31,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 11:45:31,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 11:45:31,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 11:45:31,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 11:45:31,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 11:45:31,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 11:45:31,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 11:45:31,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 11:45:31,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 11:45:31,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 11:45:31,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 11:45:31,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 11:45:31,696 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 11:45:31,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 11:45:31,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 11:45:31,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 11:45:31,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 11:45:31,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 11:45:31,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 11:45:31,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 11:45:31,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 11:45:31,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 11:45:31,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 11:45:31,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 11:45:31,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 11:45:31,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 11:45:31,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 11:45:31,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 11:45:31,708 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 11:45:31,708 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 11:45:31,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 11:45:31,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 11:45:31,709 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 11:45:31,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 11:45:31,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 11:45:31,710 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 11:45:31,716 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 11:45:31,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 11:45:31,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 11:45:31,717 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 11:45:31,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 11:45:31,717 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 11:45:31,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 11:45:31,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 11:45:31,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 11:45:31,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 11:45:31,718 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 11:45:31,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 11:45:31,718 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 11:45:31,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 11:45:31,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 11:45:31,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 11:45:31,718 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 11:45:31,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 11:45:31,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:45:31,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 11:45:31,719 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 11:45:31,719 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 11:45:31,720 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 11:45:31,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 11:45:31,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 11:45:31,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 11:45:31,950 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 11:45:31,951 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 11:45:31,952 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s4lif.c [2022-01-31 11:45:32,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6c5658a/17283ce2df1241b79689f7f8f94c2f81/FLAG9d5d9d485 [2022-01-31 11:45:32,356 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 11:45:32,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s4lif.c [2022-01-31 11:45:32,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6c5658a/17283ce2df1241b79689f7f8f94c2f81/FLAG9d5d9d485 [2022-01-31 11:45:32,368 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6c5658a/17283ce2df1241b79689f7f8f94c2f81 [2022-01-31 11:45:32,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 11:45:32,371 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 11:45:32,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 11:45:32,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 11:45:32,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 11:45:32,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:45:32" (1/1) ... [2022-01-31 11:45:32,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2298e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:45:32, skipping insertion in model container [2022-01-31 11:45:32,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:45:32" (1/1) ... [2022-01-31 11:45:32,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 11:45:32,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 11:45:32,491 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-fpi/s4lif.c[588,601] [2022-01-31 11:45:32,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:45:32,550 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 11:45:32,563 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-fpi/s4lif.c[588,601] [2022-01-31 11:45:32,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:45:32,589 INFO L208 MainTranslator]: Completed translation [2022-01-31 11:45:32,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:45:32 WrapperNode [2022-01-31 11:45:32,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 11:45:32,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 11:45:32,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 11:45:32,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 11:45:32,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:45:32" (1/1) ... [2022-01-31 11:45:32,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:45:32" (1/1) ... [2022-01-31 11:45:32,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:45:32" (1/1) ... [2022-01-31 11:45:32,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:45:32" (1/1) ... [2022-01-31 11:45:32,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:45:32" (1/1) ... [2022-01-31 11:45:32,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:45:32" (1/1) ... [2022-01-31 11:45:32,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:45:32" (1/1) ... [2022-01-31 11:45:32,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 11:45:32,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 11:45:32,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 11:45:32,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 11:45:32,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:45:32" (1/1) ... [2022-01-31 11:45:32,651 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:45:32,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:32,679 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 11:45:32,681 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 11:45:32,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 11:45:32,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 11:45:32,702 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 11:45:32,702 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 11:45:32,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 11:45:32,703 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 11:45:32,703 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 11:45:32,703 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 11:45:32,703 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 11:45:32,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 11:45:32,703 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 11:45:32,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 11:45:32,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 11:45:32,704 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 11:45:32,704 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 11:45:32,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 11:45:32,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 11:45:32,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 11:45:32,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 11:45:32,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 11:45:32,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 11:45:32,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 11:45:32,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 11:45:32,759 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 11:45:32,760 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 11:45:32,870 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 11:45:32,874 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 11:45:32,874 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 11:45:32,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:45:32 BoogieIcfgContainer [2022-01-31 11:45:32,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 11:45:32,876 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 11:45:32,876 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 11:45:32,884 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 11:45:32,887 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:45:32" (1/1) ... [2022-01-31 11:45:32,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:45:32 BasicIcfg [2022-01-31 11:45:32,910 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 11:45:32,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 11:45:32,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 11:45:32,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 11:45:32,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:45:32" (1/4) ... [2022-01-31 11:45:32,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a49a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:45:32, skipping insertion in model container [2022-01-31 11:45:32,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:45:32" (2/4) ... [2022-01-31 11:45:32,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a49a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:45:32, skipping insertion in model container [2022-01-31 11:45:32,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:45:32" (3/4) ... [2022-01-31 11:45:32,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a49a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:45:32, skipping insertion in model container [2022-01-31 11:45:32,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:45:32" (4/4) ... [2022-01-31 11:45:32,916 INFO L111 eAbstractionObserver]: Analyzing ICFG s4lif.cJordan [2022-01-31 11:45:32,920 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 11:45:32,920 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 11:45:32,954 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 11:45:32,959 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 11:45:32,959 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 11:45:32,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 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 11:45:32,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 11:45:32,971 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:32,972 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] [2022-01-31 11:45:32,972 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:32,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:32,978 INFO L85 PathProgramCache]: Analyzing trace with hash -2015912082, now seen corresponding path program 1 times [2022-01-31 11:45:32,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:32,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011084178] [2022-01-31 11:45:32,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:32,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:33,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:45:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:33,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:45:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:33,163 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 11:45:33,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:33,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011084178] [2022-01-31 11:45:33,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011084178] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:45:33,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:45:33,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 11:45:33,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043823231] [2022-01-31 11:45:33,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:45:33,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 11:45:33,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:33,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 11:45:33,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:45:33,200 INFO L87 Difference]: Start difference. First operand has 35 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 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.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 11:45:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:33,255 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-01-31 11:45:33,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 11:45:33,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 23 [2022-01-31 11:45:33,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:33,263 INFO L225 Difference]: With dead ends: 35 [2022-01-31 11:45:33,264 INFO L226 Difference]: Without dead ends: 28 [2022-01-31 11:45:33,265 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 11:45:33,271 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:33,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 43 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 11:45:33,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-31 11:45:33,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-31 11:45:33,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:45:33,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-01-31 11:45:33,299 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2022-01-31 11:45:33,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:33,300 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-01-31 11:45:33,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 11:45:33,301 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-01-31 11:45:33,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 11:45:33,301 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:33,302 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] [2022-01-31 11:45:33,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 11:45:33,302 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:33,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:33,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1605612235, now seen corresponding path program 1 times [2022-01-31 11:45:33,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:33,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409546586] [2022-01-31 11:45:33,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:33,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:33,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:45:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:33,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:45:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:33,395 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 11:45:33,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:33,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409546586] [2022-01-31 11:45:33,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409546586] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:45:33,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:45:33,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 11:45:33,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442643992] [2022-01-31 11:45:33,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:45:33,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:45:33,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:33,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:45:33,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 11:45:33,399 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 11:45:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:33,477 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-01-31 11:45:33,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 11:45:33,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 23 [2022-01-31 11:45:33,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:33,479 INFO L225 Difference]: With dead ends: 35 [2022-01-31 11:45:33,479 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 11:45:33,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 11:45:33,480 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 39 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:33,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 25 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:45:33,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 11:45:33,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-01-31 11:45:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:45:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-01-31 11:45:33,488 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2022-01-31 11:45:33,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:33,491 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-01-31 11:45:33,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 11:45:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-01-31 11:45:33,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 11:45:33,492 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:33,492 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, 1, 1] [2022-01-31 11:45:33,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 11:45:33,492 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:33,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:33,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1735281572, now seen corresponding path program 1 times [2022-01-31 11:45:33,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:33,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321721324] [2022-01-31 11:45:33,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:33,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:33,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:45:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:34,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:45:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:45:34,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:34,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321721324] [2022-01-31 11:45:34,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321721324] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:45:34,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685620085] [2022-01-31 11:45:34,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:34,027 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:34,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:34,029 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 11:45:34,037 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 11:45:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:34,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-31 11:45:34,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:34,234 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 10 treesize of output 8 [2022-01-31 11:45:34,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:45:34,290 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 14 treesize of output 16 [2022-01-31 11:45:34,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-01-31 11:45:34,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-01-31 11:45:34,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-31 11:45:34,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:45:34,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:34,956 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:45:34,957 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 28 [2022-01-31 11:45:35,008 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:45:35,008 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-01-31 11:45:35,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:45:35,012 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 20 treesize of output 12 [2022-01-31 11:45:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:45:35,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685620085] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:35,043 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:45:35,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 32 [2022-01-31 11:45:35,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928640452] [2022-01-31 11:45:35,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:35,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 11:45:35,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:35,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 11:45:35,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2022-01-31 11:45:35,047 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 32 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:45:35,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:35,516 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-01-31 11:45:35,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 11:45:35,517 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-01-31 11:45:35,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:35,517 INFO L225 Difference]: With dead ends: 59 [2022-01-31 11:45:35,517 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 11:45:35,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=307, Invalid=1499, Unknown=0, NotChecked=0, Total=1806 [2022-01-31 11:45:35,519 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 46 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:35,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 120 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 415 Invalid, 0 Unknown, 56 Unchecked, 0.2s Time] [2022-01-31 11:45:35,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 11:45:35,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2022-01-31 11:45:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:45:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-01-31 11:45:35,523 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 30 [2022-01-31 11:45:35,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:35,523 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-01-31 11:45:35,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:45:35,523 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-01-31 11:45:35,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 11:45:35,524 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:35,524 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, 1, 1] [2022-01-31 11:45:35,542 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 11:45:35,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:35,725 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:35,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:35,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1606198853, now seen corresponding path program 1 times [2022-01-31 11:45:35,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:35,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425810838] [2022-01-31 11:45:35,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:35,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:35,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:45:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:35,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:45:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:45:35,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:35,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425810838] [2022-01-31 11:45:35,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425810838] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:45:35,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803822565] [2022-01-31 11:45:35,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:35,826 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:35,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:35,827 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 11:45:35,829 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 11:45:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:35,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 11:45:35,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:35,901 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 11 treesize of output 7 [2022-01-31 11:45:35,922 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 11:45:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:45:35,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:35,970 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 14 treesize of output 12 [2022-01-31 11:45:35,976 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 22 treesize of output 20 [2022-01-31 11:45:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:45:36,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803822565] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:36,003 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:45:36,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-01-31 11:45:36,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338326448] [2022-01-31 11:45:36,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:36,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 11:45:36,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:36,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 11:45:36,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 11:45:36,005 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 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 11:45:36,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:36,090 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-01-31 11:45:36,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 11:45:36,093 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 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 30 [2022-01-31 11:45:36,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:36,094 INFO L225 Difference]: With dead ends: 47 [2022-01-31 11:45:36,094 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 11:45:36,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-01-31 11:45:36,095 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:36,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 95 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:45:36,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 11:45:36,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2022-01-31 11:45:36,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:45:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-01-31 11:45:36,098 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 30 [2022-01-31 11:45:36,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:36,099 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-01-31 11:45:36,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 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 11:45:36,099 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-01-31 11:45:36,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 11:45:36,099 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:36,099 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 11:45:36,115 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 11:45:36,303 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,SelfDestructingSolverStorable3 [2022-01-31 11:45:36,304 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:36,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:36,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1325106111, now seen corresponding path program 2 times [2022-01-31 11:45:36,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:36,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733094384] [2022-01-31 11:45:36,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:36,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:36,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:45:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:36,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:45:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:45:36,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:36,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733094384] [2022-01-31 11:45:36,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733094384] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:45:36,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173531930] [2022-01-31 11:45:36,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:45:36,360 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:36,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:36,363 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:45:36,366 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 11:45:36,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:45:36,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:45:36,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:45:36,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:36,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:45:36,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:45:36,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173531930] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:36,521 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:45:36,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:45:36,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292894805] [2022-01-31 11:45:36,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:36,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:45:36,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:36,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:45:36,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:45:36,523 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 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 11:45:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:36,654 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2022-01-31 11:45:36,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:45:36,654 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 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 32 [2022-01-31 11:45:36,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:36,659 INFO L225 Difference]: With dead ends: 63 [2022-01-31 11:45:36,659 INFO L226 Difference]: Without dead ends: 54 [2022-01-31 11:45:36,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:45:36,662 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 52 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:36,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 52 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:45:36,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-31 11:45:36,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2022-01-31 11:45:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:45:36,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-01-31 11:45:36,672 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2022-01-31 11:45:36,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:36,672 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-01-31 11:45:36,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 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 11:45:36,672 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-01-31 11:45:36,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 11:45:36,673 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:36,673 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 11:45:36,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-31 11:45:36,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:36,879 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:36,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:36,880 INFO L85 PathProgramCache]: Analyzing trace with hash -366582984, now seen corresponding path program 3 times [2022-01-31 11:45:36,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:36,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67176746] [2022-01-31 11:45:36,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:36,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:36,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:45:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:36,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:45:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:45:36,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:36,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67176746] [2022-01-31 11:45:36,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67176746] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:45:36,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138602294] [2022-01-31 11:45:36,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:45:36,933 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:36,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:36,934 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 11:45:36,935 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 11:45:36,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 11:45:36,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:45:36,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:45:36,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:45:37,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:45:37,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138602294] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:37,107 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:45:37,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:45:37,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64952145] [2022-01-31 11:45:37,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:37,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:45:37,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:37,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:45:37,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:45:37,108 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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 11:45:37,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:37,226 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-01-31 11:45:37,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:45:37,226 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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 32 [2022-01-31 11:45:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:37,227 INFO L225 Difference]: With dead ends: 41 [2022-01-31 11:45:37,227 INFO L226 Difference]: Without dead ends: 41 [2022-01-31 11:45:37,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-01-31 11:45:37,228 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 42 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:37,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 70 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:45:37,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-31 11:45:37,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-01-31 11:45:37,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:45:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-01-31 11:45:37,230 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 32 [2022-01-31 11:45:37,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:37,231 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-01-31 11:45:37,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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 11:45:37,231 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-01-31 11:45:37,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 11:45:37,231 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:37,231 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:45:37,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-31 11:45:37,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:37,432 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:37,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:37,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1933376935, now seen corresponding path program 4 times [2022-01-31 11:45:37,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:37,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811173578] [2022-01-31 11:45:37,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:37,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:38,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:45:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:38,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:45:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:38,200 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 11:45:38,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:38,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811173578] [2022-01-31 11:45:38,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811173578] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:45:38,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271496925] [2022-01-31 11:45:38,201 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:45:38,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:38,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:38,202 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 11:45:38,203 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 11:45:38,243 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:45:38,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:45:38,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 54 conjunts are in the unsatisfiable core [2022-01-31 11:45:38,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:38,269 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 11 treesize of output 7 [2022-01-31 11:45:38,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:38,297 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 14 treesize of output 16 [2022-01-31 11:45:38,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:38,339 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 14 treesize of output 16 [2022-01-31 11:45:38,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:38,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 11:45:38,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:38,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:38,657 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-01-31 11:45:38,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:38,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:38,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:45:38,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-01-31 11:45:38,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:38,919 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-01-31 11:45:39,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:39,018 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-01-31 11:45:39,084 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 11:45:39,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:39,946 INFO L353 Elim1Store]: treesize reduction 52, result has 41.6 percent of original size [2022-01-31 11:45:39,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 554 treesize of output 290 [2022-01-31 11:45:40,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:45:40,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2022-01-31 11:45:40,114 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse5 (+ c_main_~a~0.offset 4)) (.cse1 (select v_arrayElimArr_4 c_main_~a~0.offset))) (or (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_4))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse0 (select .cse4 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse0 .cse1))) c_main_~a~0.base) .cse5))) (and (<= (+ c_main_~i~0 1) (div (+ .cse0 .cse1 .cse2) 5)) (<= (div (+ (- 1) .cse0 .cse1 .cse2) 5) c_main_~i~0)))))) (not (= (+ (select v_arrayElimArr_4 .cse5) (- 4)) 1)) (not (= (+ (- 4) .cse1) 1))))) is different from false [2022-01-31 11:45:42,240 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse5 (+ c_main_~a~0.offset 4)) (.cse1 (select v_arrayElimArr_4 c_main_~a~0.offset))) (or (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_4))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse0 (select .cse4 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse0 .cse1))) c_main_~a~0.base) .cse5))) (and (<= (div (+ (- 1) .cse0 .cse1 .cse2) 5) (+ c_main_~i~0 1)) (<= (+ c_main_~i~0 2) (div (+ .cse0 .cse1 .cse2) 5))))))) (not (= (+ (select v_arrayElimArr_4 .cse5) (- 4)) 1)) (not (= (+ (- 4) .cse1) 1))))) is different from false [2022-01-31 11:45:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-31 11:45:42,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271496925] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:42,299 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:45:42,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 20] total 56 [2022-01-31 11:45:42,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275292174] [2022-01-31 11:45:42,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:42,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-01-31 11:45:42,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:42,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-01-31 11:45:42,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=2521, Unknown=2, NotChecked=210, Total=3080 [2022-01-31 11:45:42,302 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 56 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 53 states have internal predecessors, (76), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:45:44,705 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~i~0 0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= c_main_~a~0.offset 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse5 (+ c_main_~a~0.offset 4)) (.cse1 (select v_arrayElimArr_4 c_main_~a~0.offset))) (or (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_4))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse0 (select .cse4 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse0 .cse1))) c_main_~a~0.base) .cse5))) (and (<= (div (+ (- 1) .cse0 .cse1 .cse2) 5) (+ c_main_~i~0 1)) (<= (+ c_main_~i~0 2) (div (+ .cse0 .cse1 .cse2) 5))))))) (not (= (+ (select v_arrayElimArr_4 .cse5) (- 4)) 1)) (not (= (+ (- 4) .cse1) 1))))) (let ((.cse15 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse14 (select .cse15 c_main_~a~0.offset))) (let ((.cse12 (store .cse15 c_main_~a~0.offset (+ .cse14 4))) (.cse10 (+ c_main_~a~0.offset 4))) (let ((.cse13 (select .cse12 .cse10))) (or (= (* c_~N~0 5) (let ((.cse11 (store .cse12 .cse10 (+ 4 .cse13)))) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base .cse11))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse8 (select .cse11 c_main_~a~0.offset)) (.cse9 (select .cse7 |c_main_~#sum~0.offset|))) (+ (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse8 .cse9))) c_main_~a~0.base) .cse10) .cse8 .cse9)))))) (not (= .cse14 1)) (< c_main_~i~0 c_~N~0) (not (= 1 .cse13))))))) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0)) is different from false [2022-01-31 11:45:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:49,572 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2022-01-31 11:45:49,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 11:45:49,572 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 53 states have internal predecessors, (76), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-01-31 11:45:49,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:49,573 INFO L225 Difference]: With dead ends: 74 [2022-01-31 11:45:49,573 INFO L226 Difference]: Without dead ends: 70 [2022-01-31 11:45:49,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1434 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=562, Invalid=3737, Unknown=3, NotChecked=390, Total=4692 [2022-01-31 11:45:49,575 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:49,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 177 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 840 Invalid, 0 Unknown, 146 Unchecked, 1.9s Time] [2022-01-31 11:45:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-31 11:45:49,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 51. [2022-01-31 11:45:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:45:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-01-31 11:45:49,578 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 37 [2022-01-31 11:45:49,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:49,578 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-01-31 11:45:49,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 53 states have internal predecessors, (76), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:45:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-01-31 11:45:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 11:45:49,579 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:49,579 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:45:49,600 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 11:45:49,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:49,780 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:49,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:49,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1856031736, now seen corresponding path program 1 times [2022-01-31 11:45:49,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:49,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363444493] [2022-01-31 11:45:49,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:49,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:50,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:45:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:50,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:45:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:45:50,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:50,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363444493] [2022-01-31 11:45:50,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363444493] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:45:50,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714151550] [2022-01-31 11:45:50,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:50,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:50,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:50,280 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 11:45:50,298 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 11:45:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:50,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-31 11:45:50,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:50,436 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 13 treesize of output 9 [2022-01-31 11:45:50,613 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:45:50,613 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 25 treesize of output 24 [2022-01-31 11:45:50,701 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 7 [2022-01-31 11:45:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:45:50,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:51,099 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 16 treesize of output 14 [2022-01-31 11:45:51,105 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 28 treesize of output 24 [2022-01-31 11:45:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:45:51,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714151550] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:51,191 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:45:51,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 19 [2022-01-31 11:45:51,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483538424] [2022-01-31 11:45:51,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:51,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 11:45:51,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:51,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 11:45:51,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-01-31 11:45:51,192 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 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 11:45:52,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:52,283 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-01-31 11:45:52,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:45:52,284 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 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 37 [2022-01-31 11:45:52,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:52,284 INFO L225 Difference]: With dead ends: 59 [2022-01-31 11:45:52,284 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 11:45:52,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2022-01-31 11:45:52,285 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:52,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 97 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 11:45:52,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 11:45:52,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2022-01-31 11:45:52,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:45:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-01-31 11:45:52,290 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 37 [2022-01-31 11:45:52,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:52,290 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-01-31 11:45:52,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 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 11:45:52,290 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-01-31 11:45:52,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:45:52,291 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:52,291 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] [2022-01-31 11:45:52,308 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 11:45:52,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:52,496 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:52,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:52,496 INFO L85 PathProgramCache]: Analyzing trace with hash -65976708, now seen corresponding path program 5 times [2022-01-31 11:45:52,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:52,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887971012] [2022-01-31 11:45:52,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:52,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:52,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:45:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:52,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:45:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:52,758 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 11:45:52,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:52,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887971012] [2022-01-31 11:45:52,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887971012] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:45:52,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363274145] [2022-01-31 11:45:52,758 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:45:52,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:52,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:52,759 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 11:45:52,760 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 11:45:52,816 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 11:45:52,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:45:52,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:45:52,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 11:45:53,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 11:45:53,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363274145] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:53,301 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:45:53,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:45:53,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192354936] [2022-01-31 11:45:53,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:53,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:45:53,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:53,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:45:53,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:45:53,302 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 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 11:45:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:53,848 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-01-31 11:45:53,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:45:53,849 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 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 39 [2022-01-31 11:45:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:53,849 INFO L225 Difference]: With dead ends: 77 [2022-01-31 11:45:53,849 INFO L226 Difference]: Without dead ends: 63 [2022-01-31 11:45:53,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-01-31 11:45:53,850 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 91 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:53,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 41 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 11:45:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-31 11:45:53,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2022-01-31 11:45:53,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:45:53,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-01-31 11:45:53,853 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 39 [2022-01-31 11:45:53,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:53,853 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-01-31 11:45:53,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 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 11:45:53,853 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-01-31 11:45:53,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:45:53,855 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:53,855 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] [2022-01-31 11:45:53,872 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 11:45:54,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:54,066 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:54,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:54,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1588667389, now seen corresponding path program 6 times [2022-01-31 11:45:54,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:54,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841158386] [2022-01-31 11:45:54,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:54,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:54,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:45:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:54,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:45:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:45:54,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:54,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841158386] [2022-01-31 11:45:54,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841158386] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:45:54,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286596174] [2022-01-31 11:45:54,322 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:45:54,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:54,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:54,328 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 11:45:54,329 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 11:45:54,384 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 11:45:54,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:45:54,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:45:54,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:45:54,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:45:54,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286596174] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:54,914 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:45:54,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:45:54,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059012143] [2022-01-31 11:45:54,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:54,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:45:54,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:54,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:45:54,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:45:54,915 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 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 11:45:55,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:55,635 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-01-31 11:45:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 11:45:55,635 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 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 39 [2022-01-31 11:45:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:55,636 INFO L225 Difference]: With dead ends: 48 [2022-01-31 11:45:55,636 INFO L226 Difference]: Without dead ends: 48 [2022-01-31 11:45:55,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-01-31 11:45:55,636 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 75 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:55,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 64 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 11:45:55,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-31 11:45:55,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2022-01-31 11:45:55,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:45:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-01-31 11:45:55,639 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 39 [2022-01-31 11:45:55,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:55,639 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-01-31 11:45:55,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 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 11:45:55,639 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-01-31 11:45:55,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 11:45:55,639 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:55,640 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-01-31 11:45:55,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-31 11:45:55,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-31 11:45:55,856 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:55,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:55,856 INFO L85 PathProgramCache]: Analyzing trace with hash 347994970, now seen corresponding path program 7 times [2022-01-31 11:45:55,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:55,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425442552] [2022-01-31 11:45:55,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:55,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:59,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:45:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:59,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:45:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:45:59,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:59,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425442552] [2022-01-31 11:45:59,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425442552] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:45:59,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142956277] [2022-01-31 11:45:59,275 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:45:59,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:59,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:59,276 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:45:59,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-31 11:45:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:59,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 75 conjunts are in the unsatisfiable core [2022-01-31 11:45:59,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:59,370 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 10 treesize of output 8 [2022-01-31 11:45:59,386 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:45:59,414 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 14 treesize of output 16 [2022-01-31 11:45:59,472 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 14 treesize of output 16 [2022-01-31 11:45:59,544 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 14 treesize of output 16 [2022-01-31 11:46:00,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 11:46:00,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:46:00,539 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2022-01-31 11:46:01,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:46:01,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:46:01,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:46:01,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2022-01-31 11:46:01,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:46:01,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:46:01,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:46:01,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:46:01,671 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2022-01-31 11:46:02,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:46:02,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:46:02,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:46:02,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:46:02,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:46:02,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:46:02,224 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 55 [2022-01-31 11:46:02,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2022-01-31 11:46:03,066 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2022-01-31 11:46:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:46:03,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:46:09,538 INFO L353 Elim1Store]: treesize reduction 476, result has 26.2 percent of original size [2022-01-31 11:46:09,539 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 6 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 39 case distinctions, treesize of input 38624 treesize of output 12140 [2022-01-31 11:46:09,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:46:09,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:46:09,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:46:09,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 33 [2022-01-31 11:46:09,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:46:09,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:46:09,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:46:09,832 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2022-01-31 11:46:09,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:46:09,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:46:09,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:46:09,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2022-01-31 11:46:09,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:46:09,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:46:09,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:46:09,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 27 [2022-01-31 11:46:09,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:46:09,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:46:09,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:46:09,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2022-01-31 11:46:13,046 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int))) (let ((.cse0 (+ c_main_~a~0.offset 8)) (.cse1 (select v_arrayElimArr_7 c_main_~a~0.offset)) (.cse2 (+ c_main_~a~0.offset 4))) (or (not (= (select v_arrayElimArr_7 .cse0) 5)) (not (= (+ (- 4) .cse1) 1)) (not (= 5 (select v_arrayElimArr_7 .cse2))) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_7))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse10 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse9 .cse1))) c_main_~a~0.base) .cse2))) (let ((.cse3 (* (- 1) .cse9)) (.cse4 (* (- 1) .cse1)) (.cse5 (* (- 1) .cse10)) (.cse6 (* (- 1) (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse9 .cse10 .cse1))) c_main_~a~0.base) .cse0)))) (and (<= (div (+ .cse3 .cse4 .cse5 .cse6) (- 5)) (+ c_main_~i~0 1)) (<= (+ c_main_~i~0 2) (div (+ (- 1) .cse3 .cse4 .cse5 .cse6) (- 5)))))))))))) is different from false [2022-01-31 11:46:16,408 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int))) (let ((.cse0 (+ c_main_~a~0.offset 8)) (.cse9 (select v_arrayElimArr_7 c_main_~a~0.offset)) (.cse10 (+ c_main_~a~0.offset 4))) (or (not (= (select v_arrayElimArr_7 .cse0) 5)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_7))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse8 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse7 .cse9))) c_main_~a~0.base) .cse10))) (let ((.cse1 (* (- 1) .cse7)) (.cse2 (* (- 1) .cse9)) (.cse3 (* (- 1) .cse8)) (.cse4 (* (- 1) (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse7 .cse8 .cse9))) c_main_~a~0.base) .cse0)))) (and (<= (div (+ .cse1 .cse2 .cse3 .cse4) (- 5)) (+ c_main_~i~0 2)) (<= (+ c_main_~i~0 3) (div (+ (- 1) .cse1 .cse2 .cse3 .cse4) (- 5))))))))) (not (= (+ (- 4) .cse9) 1)) (not (= 5 (select v_arrayElimArr_7 .cse10)))))) is different from false [2022-01-31 11:46:20,134 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int))) (let ((.cse0 (+ c_main_~a~0.offset 8)) (.cse9 (select v_arrayElimArr_7 c_main_~a~0.offset)) (.cse10 (+ c_main_~a~0.offset 4))) (or (not (= (select v_arrayElimArr_7 .cse0) 5)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_7))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse8 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse7 .cse9))) c_main_~a~0.base) .cse10))) (let ((.cse1 (* (- 1) .cse7)) (.cse2 (* (- 1) .cse9)) (.cse3 (* (- 1) .cse8)) (.cse4 (* (- 1) (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse7 .cse8 .cse9))) c_main_~a~0.base) .cse0)))) (and (<= (+ c_main_~i~0 4) (div (+ (- 1) .cse1 .cse2 .cse3 .cse4) (- 5))) (<= (div (+ .cse1 .cse2 .cse3 .cse4) (- 5)) (+ c_main_~i~0 3)))))))) (not (= (+ (- 4) .cse9) 1)) (not (= 5 (select v_arrayElimArr_7 .cse10)))))) is different from false [2022-01-31 11:46:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-01-31 11:46:20,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142956277] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:46:20,482 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:46:20,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 26] total 67 [2022-01-31 11:46:20,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796692524] [2022-01-31 11:46:20,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:46:20,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-01-31 11:46:20,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:46:20,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-01-31 11:46:20,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=3590, Unknown=3, NotChecked=378, Total=4422 [2022-01-31 11:46:20,484 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 67 states, 65 states have (on average 1.353846153846154) internal successors, (88), 64 states have internal predecessors, (88), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:17,133 WARN L228 SmtUtils]: Spent 17.45s on a formula simplification. DAG size of input: 82 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:48:14,880 WARN L228 SmtUtils]: Spent 5.39s on a formula simplification. DAG size of input: 166 DAG size of output: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:48:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:48:16,414 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-01-31 11:48:16,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-31 11:48:16,415 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 65 states have (on average 1.353846153846154) internal successors, (88), 64 states have internal predecessors, (88), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-01-31 11:48:16,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:48:16,415 INFO L225 Difference]: With dead ends: 84 [2022-01-31 11:48:16,415 INFO L226 Difference]: Without dead ends: 80 [2022-01-31 11:48:16,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 80 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1841 ImplicationChecksByTransitivity, 125.5s TimeCoverageRelationStatistics Valid=726, Invalid=5425, Unknown=23, NotChecked=468, Total=6642 [2022-01-31 11:48:16,417 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 44 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:48:16,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 216 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1300 Invalid, 0 Unknown, 160 Unchecked, 10.0s Time] [2022-01-31 11:48:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-31 11:48:16,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 64. [2022-01-31 11:48:16,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 57 states have internal predecessors, (65), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:48:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-01-31 11:48:16,420 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 44 [2022-01-31 11:48:16,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:48:16,420 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-01-31 11:48:16,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 65 states have (on average 1.353846153846154) internal successors, (88), 64 states have internal predecessors, (88), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:48:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-01-31 11:48:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 11:48:16,421 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:48:16,421 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:48:16,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-31 11:48:16,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:48:16,636 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:48:16,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:48:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash -162539207, now seen corresponding path program 2 times [2022-01-31 11:48:16,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:48:16,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756350648] [2022-01-31 11:48:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:48:16,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:48:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:18,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:48:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:18,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:48:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:48:18,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:48:18,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756350648] [2022-01-31 11:48:18,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756350648] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:48:18,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755829989] [2022-01-31 11:48:18,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:48:18,256 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:48:18,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:48:18,257 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:48:18,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-31 11:48:18,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:48:18,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:48:18,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-31 11:48:18,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:48:18,847 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 13 treesize of output 9 [2022-01-31 11:48:19,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:19,334 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 25 treesize of output 24 [2022-01-31 11:48:19,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:19,636 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 25 treesize of output 24 [2022-01-31 11:48:19,870 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 11:48:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:48:20,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:48:21,536 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 16 treesize of output 14 [2022-01-31 11:48:21,550 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 28 treesize of output 24 [2022-01-31 11:48:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:48:21,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755829989] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:48:21,978 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:48:21,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2022-01-31 11:48:21,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125159784] [2022-01-31 11:48:21,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:48:21,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 11:48:21,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:48:21,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 11:48:21,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2022-01-31 11:48:21,980 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 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 11:48:27,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:48:27,280 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-01-31 11:48:27,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 11:48:27,281 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 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 44 [2022-01-31 11:48:27,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:48:27,281 INFO L225 Difference]: With dead ends: 72 [2022-01-31 11:48:27,281 INFO L226 Difference]: Without dead ends: 72 [2022-01-31 11:48:27,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=247, Invalid=1393, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 11:48:27,282 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 52 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:48:27,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 140 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-01-31 11:48:27,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-31 11:48:27,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2022-01-31 11:48:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:48:27,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-01-31 11:48:27,284 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 44 [2022-01-31 11:48:27,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:48:27,285 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-01-31 11:48:27,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 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 11:48:27,285 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-01-31 11:48:27,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 11:48:27,285 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:48:27,285 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-01-31 11:48:27,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-31 11:48:27,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-31 11:48:27,500 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:48:27,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:48:27,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1899103037, now seen corresponding path program 8 times [2022-01-31 11:48:27,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:48:27,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853051466] [2022-01-31 11:48:27,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:48:27,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:48:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:28,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:48:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:28,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:48:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:28,237 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:48:28,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:48:28,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853051466] [2022-01-31 11:48:28,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853051466] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:48:28,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698324753] [2022-01-31 11:48:28,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:48:28,237 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:48:28,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:48:28,238 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:48:28,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-31 11:48:28,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:48:28,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:48:28,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:48:28,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:48:29,351 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:48:29,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:48:29,884 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:48:29,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698324753] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:48:29,884 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:48:29,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:48:29,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647902830] [2022-01-31 11:48:29,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:48:29,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:48:29,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:48:29,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:48:29,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:48:29,885 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 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 11:48:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:48:31,883 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2022-01-31 11:48:31,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:48:31,883 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 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 46 [2022-01-31 11:48:31,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:48:31,884 INFO L225 Difference]: With dead ends: 91 [2022-01-31 11:48:31,884 INFO L226 Difference]: Without dead ends: 72 [2022-01-31 11:48:31,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-01-31 11:48:31,884 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 104 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-31 11:48:31,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 50 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-31 11:48:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-31 11:48:31,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2022-01-31 11:48:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:48:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-01-31 11:48:31,892 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 46 [2022-01-31 11:48:31,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:48:31,892 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-01-31 11:48:31,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 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 11:48:31,893 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-01-31 11:48:31,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 11:48:31,893 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:48:31,893 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-01-31 11:48:31,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-31 11:48:32,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-31 11:48:32,095 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:48:32,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:48:32,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1847163190, now seen corresponding path program 9 times [2022-01-31 11:48:32,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:48:32,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085697714] [2022-01-31 11:48:32,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:48:32,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:48:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:32,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:48:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:32,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:48:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:48:32,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:48:32,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085697714] [2022-01-31 11:48:32,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085697714] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:48:32,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326839700] [2022-01-31 11:48:32,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:48:32,940 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:48:32,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:48:32,941 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:48:32,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-31 11:48:33,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 11:48:33,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:48:33,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:48:33,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:48:34,107 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:48:34,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:48:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:48:34,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326839700] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:48:34,655 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:48:34,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:48:34,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123291022] [2022-01-31 11:48:34,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:48:34,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:48:34,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:48:34,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:48:34,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:48:34,656 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 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 11:48:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:48:36,798 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-01-31 11:48:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:48:36,798 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 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 46 [2022-01-31 11:48:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:48:36,799 INFO L225 Difference]: With dead ends: 55 [2022-01-31 11:48:36,799 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 11:48:36,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-01-31 11:48:36,800 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 89 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:48:36,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 50 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 11:48:36,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 11:48:36,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2022-01-31 11:48:36,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:48:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-01-31 11:48:36,802 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 46 [2022-01-31 11:48:36,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:48:36,802 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-01-31 11:48:36,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 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 11:48:36,802 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-01-31 11:48:36,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 11:48:36,802 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:48:36,802 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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 11:48:36,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-31 11:48:37,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-31 11:48:37,015 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:48:37,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:48:37,016 INFO L85 PathProgramCache]: Analyzing trace with hash 981661415, now seen corresponding path program 10 times [2022-01-31 11:48:37,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:48:37,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080504043] [2022-01-31 11:48:37,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:48:37,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:48:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:48,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:48:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:48,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:48:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:48:48,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:48:48,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080504043] [2022-01-31 11:48:48,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080504043] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:48:48,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538990964] [2022-01-31 11:48:48,654 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:48:48,654 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:48:48,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:48:48,655 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:48:48,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-31 11:48:48,720 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:48:48,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:48:48,722 WARN L261 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 92 conjunts are in the unsatisfiable core [2022-01-31 11:48:48,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:48:48,785 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 11 treesize of output 7 [2022-01-31 11:48:49,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:49,165 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 14 treesize of output 16 [2022-01-31 11:48:49,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:49,588 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 14 treesize of output 16 [2022-01-31 11:48:50,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:50,094 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 14 treesize of output 16 [2022-01-31 11:48:50,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:50,545 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 14 treesize of output 16 [2022-01-31 11:48:52,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:52,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 11:48:54,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:54,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:54,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2022-01-31 11:48:56,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:56,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:56,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:56,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:56,140 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 53 [2022-01-31 11:48:58,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:58,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:58,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:58,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:58,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:58,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:58,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:58,050 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2022-01-31 11:48:59,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:59,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:59,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:59,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:59,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:59,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:59,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:59,653 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:48:59,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:59,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2022-01-31 11:49:01,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:01,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:01,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:01,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:01,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:01,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:01,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:01,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:01,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:01,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:01,080 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:01,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2022-01-31 11:49:02,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:02,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:02,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:02,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:02,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:02,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:02,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:02,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:02,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:02,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:02,567 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2022-01-31 11:49:03,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:03,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2022-01-31 11:49:04,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:04,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2022-01-31 11:49:06,480 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:06,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:44,198 WARN L228 SmtUtils]: Spent 8.31s on a formula simplification. DAG size of input: 791 DAG size of output: 322 (called from [L 350] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-01-31 11:49:44,198 INFO L353 Elim1Store]: treesize reduction 3907, result has 18.3 percent of original size [2022-01-31 11:49:44,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 23 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 27 new quantified variables, introduced 190 case distinctions, treesize of input 13997734 treesize of output 3101584 [2022-01-31 11:49:48,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:48,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:48,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:48,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:48,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:48,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:49,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-01-31 11:49:53,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 35 [2022-01-31 11:49:53,507 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-31 11:49:53,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,602 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2022-01-31 11:49:53,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2022-01-31 11:49:53,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,745 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2022-01-31 11:49:53,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,822 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-01-31 11:49:53,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,903 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 35 [2022-01-31 11:49:54,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 10237 treesize of output 9701 [2022-01-31 11:49:54,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,218 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2022-01-31 11:49:54,365 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-01-31 11:49:54,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2022-01-31 11:49:54,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,638 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-01-31 11:49:56,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 59 [2022-01-31 11:49:56,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,112 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2022-01-31 11:49:56,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-01-31 11:49:56,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-01-31 11:49:56,544 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-01-31 11:49:56,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 39 [2022-01-31 11:49:56,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 423 treesize of output 333 [2022-01-31 11:49:56,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:56,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 355 treesize of output 305 [2022-01-31 11:49:57,085 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:57,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:57,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:57,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:57,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:57,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:57,088 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 27 [2022-01-31 11:49:57,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:57,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:57,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:57,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:57,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:57,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:57,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 21 [2022-01-31 11:49:57,499 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_28 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ c_main_~a~0.offset 12)) (.cse6 (+ c_main_~a~0.offset 8)) (.cse7 (+ c_main_~a~0.offset 4))) (or (not (= (+ (select v_arrayElimArr_28 .cse0) (- 4)) 1)) (not (= 5 (select v_arrayElimArr_28 c_main_~a~0.offset))) (= (* 5 ~N~0) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_28))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 5 .cse3))) c_main_~a~0.base) .cse7))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 5 .cse3))) c_main_~a~0.base) .cse6))) (+ .cse1 .cse2 5 .cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 5 .cse3))) c_main_~a~0.base) .cse0)))))))) (not (= (select v_arrayElimArr_28 .cse6) 5)) (not (= (+ (select v_arrayElimArr_28 .cse7) (- 4)) 1)) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0))))) is different from false [2022-01-31 11:49:57,872 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_28 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ c_main_~a~0.offset 12)) (.cse6 (+ c_main_~a~0.offset 8)) (.cse7 (+ c_main_~a~0.offset 4))) (or (not (= (+ (select v_arrayElimArr_28 .cse0) (- 4)) 1)) (not (= 5 (select v_arrayElimArr_28 c_main_~a~0.offset))) (= (* 5 ~N~0) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_28))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 5 .cse3))) c_main_~a~0.base) .cse7))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 5 .cse3))) c_main_~a~0.base) .cse6))) (+ .cse1 .cse2 5 .cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 5 .cse3))) c_main_~a~0.base) .cse0)))))))) (not (= (select v_arrayElimArr_28 .cse6) 5)) (not (= (+ (select v_arrayElimArr_28 .cse7) (- 4)) 1)) (not (< (+ c_main_~i~0 1) ~N~0)) (< (+ c_main_~i~0 2) ~N~0)))) is different from false [2022-01-31 11:49:58,610 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_28 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ c_main_~a~0.offset 12)) (.cse6 (+ c_main_~a~0.offset 8)) (.cse7 (+ c_main_~a~0.offset 4))) (or (not (= (+ (select v_arrayElimArr_28 .cse0) (- 4)) 1)) (not (= 5 (select v_arrayElimArr_28 c_main_~a~0.offset))) (< (+ c_main_~i~0 3) ~N~0) (= (* 5 ~N~0) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_28))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 5 .cse3))) c_main_~a~0.base) .cse7))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 5 .cse3))) c_main_~a~0.base) .cse6))) (+ .cse1 .cse2 5 .cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 5 .cse3))) c_main_~a~0.base) .cse0)))))))) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= (select v_arrayElimArr_28 .cse6) 5)) (not (= (+ (select v_arrayElimArr_28 .cse7) (- 4)) 1))))) is different from false [2022-01-31 11:49:59,347 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_28 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ c_main_~a~0.offset 12)) (.cse6 (+ c_main_~a~0.offset 8)) (.cse7 (+ c_main_~a~0.offset 4))) (or (not (= (+ (select v_arrayElimArr_28 .cse0) (- 4)) 1)) (< (+ c_main_~i~0 4) ~N~0) (not (= 5 (select v_arrayElimArr_28 c_main_~a~0.offset))) (= (* 5 ~N~0) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_28))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 5 .cse3))) c_main_~a~0.base) .cse7))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 5 .cse3))) c_main_~a~0.base) .cse6))) (+ .cse1 .cse2 5 .cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 5 .cse3))) c_main_~a~0.base) .cse0)))))))) (not (< (+ c_main_~i~0 3) ~N~0)) (not (= (select v_arrayElimArr_28 .cse6) 5)) (not (= (+ (select v_arrayElimArr_28 .cse7) (- 4)) 1))))) is different from false [2022-01-31 11:49:59,746 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-01-31 11:49:59,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538990964] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:49:59,747 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:49:59,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 32, 32] total 91 [2022-01-31 11:49:59,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241840543] [2022-01-31 11:49:59,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:49:59,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-01-31 11:49:59,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:59,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-01-31 11:49:59,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=691, Invalid=6803, Unknown=4, NotChecked=692, Total=8190 [2022-01-31 11:49:59,749 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 91 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 88 states have internal predecessors, (115), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:51:30,412 WARN L228 SmtUtils]: Spent 48.84s on a formula simplification. DAG size of input: 207 DAG size of output: 198 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:52:50,978 WARN L228 SmtUtils]: Spent 1.01m on a formula simplification. DAG size of input: 212 DAG size of output: 210 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:54:23,228 WARN L228 SmtUtils]: Spent 1.12m on a formula simplification. DAG size of input: 212 DAG size of output: 210 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:54:46,656 WARN L228 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 242 DAG size of output: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:55:33,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:55:33,982 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2022-01-31 11:55:33,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-01-31 11:55:33,984 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 88 states have internal predecessors, (115), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2022-01-31 11:55:33,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:55:33,985 INFO L225 Difference]: With dead ends: 111 [2022-01-31 11:55:33,985 INFO L226 Difference]: Without dead ends: 105 [2022-01-31 11:55:33,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 138 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5992 ImplicationChecksByTransitivity, 364.4s TimeCoverageRelationStatistics Valid=1755, Invalid=16615, Unknown=6, NotChecked=1084, Total=19460 [2022-01-31 11:55:33,989 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 105 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 328 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2022-01-31 11:55:33,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 299 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 2076 Invalid, 0 Unknown, 328 Unchecked, 18.8s Time] [2022-01-31 11:55:33,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-01-31 11:55:33,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2022-01-31 11:55:33,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:55:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2022-01-31 11:55:33,992 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 51 [2022-01-31 11:55:33,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:55:33,992 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2022-01-31 11:55:33,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 88 states have internal predecessors, (115), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:55:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-01-31 11:55:33,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 11:55:33,993 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:55:33,993 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2022-01-31 11:55:34,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-31 11:55:34,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-31 11:55:34,199 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:55:34,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:55:34,200 INFO L85 PathProgramCache]: Analyzing trace with hash -15410938, now seen corresponding path program 3 times [2022-01-31 11:55:34,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:55:34,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838462398] [2022-01-31 11:55:34,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:55:34,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:55:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:55:35,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:55:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:55:35,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:55:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:55:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:55:35,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:55:35,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838462398] [2022-01-31 11:55:35,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838462398] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:55:35,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982480437] [2022-01-31 11:55:35,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:55:35,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:55:35,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:55:35,967 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:55:35,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-31 11:55:36,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 11:55:36,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:55:36,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-31 11:55:36,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:55:36,257 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 15 treesize of output 11 [2022-01-31 11:55:36,999 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 11:55:37,000 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 27 treesize of output 26 [2022-01-31 11:55:37,395 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 11:55:37,396 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 27 treesize of output 26 [2022-01-31 11:55:37,653 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-01-31 11:55:37,654 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 27 treesize of output 34 [2022-01-31 11:55:38,620 INFO L353 Elim1Store]: treesize reduction 8, result has 50.0 percent of original size [2022-01-31 11:55:38,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2022-01-31 11:55:39,084 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:55:39,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:57:23,699 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 36 treesize of output 34 [2022-01-31 11:57:23,716 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 6932 treesize of output 6820 [2022-01-31 11:57:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 12 proven. 34 refuted. 2 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-31 11:57:24,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982480437] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:57:24,776 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:57:24,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 21] total 44 [2022-01-31 11:57:24,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525132231] [2022-01-31 11:57:24,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:57:24,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-01-31 11:57:24,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:57:24,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-01-31 11:57:24,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=1525, Unknown=43, NotChecked=0, Total=1892 [2022-01-31 11:57:24,777 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 44 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 43 states have internal predecessors, (86), 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 11:57:57,027 WARN L228 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 47 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:58:05,917 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~i~0 3))) (and (<= .cse0 c_~N~0) (or (forall ((v_ArrVal_698 Int) (v_ArrVal_696 Int) (v_main_~i~0_214 Int) (v_main_~i~0_215 Int)) (or (not (<= v_main_~i~0_215 (+ c_main_~i~0 1))) (not (< (+ v_main_~i~0_214 1) c_~N~0)) (< (+ 2 v_main_~i~0_214) c_~N~0) (= (let ((.cse1 (* 4 v_main_~i~0_214))) (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215)) v_ArrVal_696) (+ c_main_~a~0.offset .cse1) v_ArrVal_698) (+ c_main_~a~0.offset .cse1 4))) 1))) (<= c_~N~0 1)) (or (< .cse0 c_~N~0) (= 1 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_~N~0 4) (- 4))))) (exists ((v_main_~i~0_202 Int)) (let ((.cse2 (+ v_main_~i~0_202 1))) (and (<= 3 v_main_~i~0_202) (<= c_~N~0 .cse2) (<= .cse2 c_~N~0) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_202) c_main_~a~0.offset)) 1)))))) is different from false [2022-01-31 11:58:07,933 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_main_~i~0 2))) (and (or (<= c_~N~0 1) (forall ((v_ArrVal_698 Int) (v_ArrVal_696 Int) (v_main_~i~0_214 Int)) (or (not (< (+ v_main_~i~0_214 1) c_~N~0)) (< (+ 2 v_main_~i~0_214) c_~N~0) (= 1 (let ((.cse0 (* 4 v_main_~i~0_214))) (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_696) (+ c_main_~a~0.offset .cse0) v_ArrVal_698) (+ c_main_~a~0.offset .cse0 4))))))) (<= .cse1 c_~N~0) (exists ((v_main_~i~0_202 Int)) (let ((.cse2 (+ v_main_~i~0_202 1))) (and (<= 3 v_main_~i~0_202) (<= c_~N~0 .cse2) (<= .cse2 c_~N~0) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_202) c_main_~a~0.offset)) 1)))) (or (< .cse1 c_~N~0) (= 1 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_~N~0 4) (- 4))))))) is different from false [2022-01-31 11:58:09,947 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_main_~i~0 2)) (.cse2 (select |c_#memory_int| c_main_~a~0.base))) (and (or (<= c_~N~0 1) (forall ((v_ArrVal_698 Int) (v_ArrVal_696 Int) (v_main_~i~0_214 Int)) (or (not (< (+ v_main_~i~0_214 1) c_~N~0)) (< (+ 2 v_main_~i~0_214) c_~N~0) (= 1 (let ((.cse0 (* 4 v_main_~i~0_214))) (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_696) (+ c_main_~a~0.offset .cse0) v_ArrVal_698) (+ c_main_~a~0.offset .cse0 4))))))) (<= .cse1 c_~N~0) (< c_main_~i~0 c_~N~0) (= |c_main_#t~mem8| (select .cse2 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (exists ((v_main_~i~0_202 Int)) (let ((.cse3 (+ v_main_~i~0_202 1))) (and (<= 3 v_main_~i~0_202) (<= c_~N~0 .cse3) (<= .cse3 c_~N~0) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_202) c_main_~a~0.offset)) 1)))) (or (< .cse1 c_~N~0) (= 1 (select .cse2 (+ c_main_~a~0.offset (* c_~N~0 4) (- 4))))))) is different from false [2022-01-31 11:58:19,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:58:19,964 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2022-01-31 11:58:19,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-31 11:58:19,965 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 43 states have internal predecessors, (86), 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 51 [2022-01-31 11:58:19,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:58:19,965 INFO L225 Difference]: With dead ends: 86 [2022-01-31 11:58:19,965 INFO L226 Difference]: Without dead ends: 86 [2022-01-31 11:58:19,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 159.5s TimeCoverageRelationStatistics Valid=620, Invalid=2869, Unknown=63, NotChecked=354, Total=3906 [2022-01-31 11:58:19,966 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-31 11:58:19,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 114 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 315 Invalid, 0 Unknown, 229 Unchecked, 1.8s Time] [2022-01-31 11:58:19,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-01-31 11:58:19,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2022-01-31 11:58:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 73 states have internal predecessors, (84), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:58:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2022-01-31 11:58:19,969 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 51 [2022-01-31 11:58:19,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:58:19,969 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2022-01-31 11:58:19,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 43 states have internal predecessors, (86), 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 11:58:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2022-01-31 11:58:19,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 11:58:19,969 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:58:19,969 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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 11:58:19,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-31 11:58:20,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:58:20,184 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:58:20,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:58:20,185 INFO L85 PathProgramCache]: Analyzing trace with hash 967200650, now seen corresponding path program 11 times [2022-01-31 11:58:20,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:58:20,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19370231] [2022-01-31 11:58:20,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:58:20,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:58:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:21,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:58:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:58:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:58:21,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:58:21,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19370231] [2022-01-31 11:58:21,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19370231] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:58:21,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182695904] [2022-01-31 11:58:21,118 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:58:21,119 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:58:21,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:58:21,119 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:58:21,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-31 11:58:21,259 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 11:58:21,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:58:21,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 11:58:21,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:58:22,477 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:58:22,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:58:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:58:22,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182695904] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:58:22,973 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:58:22,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 11:58:22,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901944623] [2022-01-31 11:58:22,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:58:22,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 11:58:22,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:58:22,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 11:58:22,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 11:58:22,974 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 20 states have internal predecessors, (70), 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 11:58:25,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:58:25,160 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2022-01-31 11:58:25,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:58:25,160 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 20 states have internal predecessors, (70), 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 53 [2022-01-31 11:58:25,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:58:25,161 INFO L225 Difference]: With dead ends: 106 [2022-01-31 11:58:25,161 INFO L226 Difference]: Without dead ends: 79 [2022-01-31 11:58:25,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-01-31 11:58:25,161 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 117 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-31 11:58:25,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 50 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-31 11:58:25,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-01-31 11:58:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 62. [2022-01-31 11:58:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:58:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-01-31 11:58:25,163 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 53 [2022-01-31 11:58:25,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:58:25,163 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-01-31 11:58:25,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 20 states have internal predecessors, (70), 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 11:58:25,163 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-01-31 11:58:25,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 11:58:25,164 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:58:25,164 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 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 11:58:25,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-01-31 11:58:25,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-31 11:58:25,381 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:58:25,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:58:25,381 INFO L85 PathProgramCache]: Analyzing trace with hash -726762955, now seen corresponding path program 12 times [2022-01-31 11:58:25,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:58:25,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120985274] [2022-01-31 11:58:25,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:58:25,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:58:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:26,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:58:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:26,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:58:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:58:26,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:58:26,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120985274] [2022-01-31 11:58:26,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120985274] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:58:26,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009738555] [2022-01-31 11:58:26,336 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:58:26,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:58:26,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:58:26,337 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:58:26,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-31 11:58:26,441 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-01-31 11:58:26,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:58:26,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 11:58:26,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:58:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:58:27,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:58:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:58:28,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009738555] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:58:28,456 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:58:28,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 11:58:28,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103025606] [2022-01-31 11:58:28,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:58:28,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 11:58:28,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:58:28,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 11:58:28,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 11:58:28,457 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 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 11:58:31,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:58:31,531 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2022-01-31 11:58:31,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 11:58:31,531 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 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 56 [2022-01-31 11:58:31,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:58:31,532 INFO L225 Difference]: With dead ends: 72 [2022-01-31 11:58:31,532 INFO L226 Difference]: Without dead ends: 72 [2022-01-31 11:58:31,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2022-01-31 11:58:31,532 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 107 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:58:31,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 59 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-31 11:58:31,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-31 11:58:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2022-01-31 11:58:31,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 57 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:58:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-01-31 11:58:31,534 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 56 [2022-01-31 11:58:31,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:58:31,534 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-01-31 11:58:31,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 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 11:58:31,535 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-01-31 11:58:31,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 11:58:31,535 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:58:31,535 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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 11:58:31,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-31 11:58:31,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-31 11:58:31,744 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:58:31,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:58:31,744 INFO L85 PathProgramCache]: Analyzing trace with hash -151111848, now seen corresponding path program 13 times [2022-01-31 11:58:31,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:58:31,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55384147] [2022-01-31 11:58:31,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:58:31,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:58:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:46,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:58:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:46,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:58:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:58:46,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:58:46,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55384147] [2022-01-31 11:58:46,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55384147] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:58:46,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023957010] [2022-01-31 11:58:46,234 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:58:46,234 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:58:46,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:58:46,235 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:58:46,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-31 11:58:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:46,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 113 conjunts are in the unsatisfiable core [2022-01-31 11:58:46,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:58:46,360 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 11 treesize of output 7 [2022-01-31 11:58:46,397 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 10 treesize of output 8 [2022-01-31 11:58:46,461 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 14 treesize of output 16 [2022-01-31 11:58:46,601 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 14 treesize of output 16 [2022-01-31 11:58:47,187 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 14 treesize of output 16 [2022-01-31 11:58:47,711 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 14 treesize of output 16 [2022-01-31 11:58:48,314 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 14 treesize of output 16 [2022-01-31 11:58:50,633 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 11:58:52,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:52,235 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2022-01-31 11:58:53,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:53,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:53,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:53,984 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 59 [2022-01-31 11:58:55,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:55,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:55,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:55,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:55,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:56,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:56,002 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2022-01-31 11:58:58,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:58,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:58,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:58,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:58,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:58,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:58,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:58,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:58,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:58,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:58,066 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2022-01-31 11:58:59,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:59,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:59,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:59,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:59,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:59,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:59,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:59,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:59,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:59,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:59,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:59,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:59,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2022-01-31 11:59:01,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:01,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:01,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:01,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:01,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:01,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:01,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:01,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:01,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:01,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:01,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:01,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:01,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:01,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:59:01,248 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 80 [2022-01-31 11:59:02,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:02,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:02,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:02,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:02,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:02,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:02,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:02,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:02,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:02,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:02,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:02,960 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:59:02,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:02,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2022-01-31 11:59:04,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:04,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:04,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:04,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:04,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:04,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:04,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:04,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:04,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:59:04,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:04,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:04,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:04,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 94 [2022-01-31 11:59:06,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 65 [2022-01-31 11:59:07,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 26 [2022-01-31 11:59:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:59:08,781 INFO L328 TraceCheckSpWp]: Computing backward predicates...