/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-patterns/array2_pattern.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:58:55,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:58:55,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:58:55,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:58:55,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:58:55,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:58:55,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:58:55,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:58:55,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:58:55,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:58:55,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:58:55,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:58:55,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:58:55,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:58:55,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:58:55,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:58:55,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:58:55,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:58:55,667 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:58:55,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:58:55,673 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:58:55,674 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:58:55,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:58:55,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:58:55,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:58:55,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:58:55,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:58:55,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:58:55,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:58:55,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:58:55,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:58:55,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:58:55,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:58:55,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:58:55,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:58:55,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:58:55,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:58:55,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:58:55,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:58:55,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:58:55,709 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:58:55,711 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 03:58:55,737 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:58:55,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:58:55,737 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:58:55,738 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:58:55,738 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:58:55,738 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:58:55,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:58:55,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:58:55,739 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:58:55,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:58:55,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:58:55,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:58:55,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:58:55,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:58:55,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:58:55,740 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:58:55,740 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:58:55,740 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:58:55,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:58:55,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:58:55,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:58:55,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:58:55,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:58:55,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:58:55,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:58:55,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:58:55,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:58:55,741 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:58:55,741 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:58:55,742 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:58:55,742 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:58:55,742 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:58:55,742 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:58:55,742 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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-10 03:58:55,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:58:55,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:58:55,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:58:55,994 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:58:55,996 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:58:55,997 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-patterns/array2_pattern.c [2022-01-10 03:58:56,055 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f966bbc21/d45961a407e1478387a9443e9af214e0/FLAG0c22b10e2 [2022-01-10 03:58:56,451 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:58:56,451 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array2_pattern.c [2022-01-10 03:58:56,456 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f966bbc21/d45961a407e1478387a9443e9af214e0/FLAG0c22b10e2 [2022-01-10 03:58:56,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f966bbc21/d45961a407e1478387a9443e9af214e0 [2022-01-10 03:58:56,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:58:56,471 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:58:56,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:58:56,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:58:56,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:58:56,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:58:56" (1/1) ... [2022-01-10 03:58:56,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f21e1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:56, skipping insertion in model container [2022-01-10 03:58:56,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:58:56" (1/1) ... [2022-01-10 03:58:56,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:58:56,502 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:58:56,658 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-patterns/array2_pattern.c[1322,1335] [2022-01-10 03:58:56,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:58:56,702 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:58:56,714 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-patterns/array2_pattern.c[1322,1335] [2022-01-10 03:58:56,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:58:56,754 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:58:56,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:56 WrapperNode [2022-01-10 03:58:56,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:58:56,758 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:58:56,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:58:56,758 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:58:56,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:56" (1/1) ... [2022-01-10 03:58:56,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:56" (1/1) ... [2022-01-10 03:58:56,802 INFO L137 Inliner]: procedures = 18, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2022-01-10 03:58:56,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:58:56,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:58:56,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:58:56,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:58:56,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:56" (1/1) ... [2022-01-10 03:58:56,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:56" (1/1) ... [2022-01-10 03:58:56,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:56" (1/1) ... [2022-01-10 03:58:56,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:56" (1/1) ... [2022-01-10 03:58:56,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:56" (1/1) ... [2022-01-10 03:58:56,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:56" (1/1) ... [2022-01-10 03:58:56,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:56" (1/1) ... [2022-01-10 03:58:56,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:58:56,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:58:56,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:58:56,843 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:58:56,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:56" (1/1) ... [2022-01-10 03:58:56,851 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:58:56,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:58:56,876 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-10 03:58:56,899 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-10 03:58:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:58:56,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:58:56,923 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-10 03:58:56,923 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-10 03:58:56,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 03:58:56,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 03:58:56,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:58:56,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:58:56,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 03:58:56,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 03:58:57,002 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:58:57,003 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:58:57,239 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:58:57,244 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:58:57,244 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-10 03:58:57,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:58:57 BoogieIcfgContainer [2022-01-10 03:58:57,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:58:57,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:58:57,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:58:57,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:58:57,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:58:56" (1/3) ... [2022-01-10 03:58:57,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51007bca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:58:57, skipping insertion in model container [2022-01-10 03:58:57,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:56" (2/3) ... [2022-01-10 03:58:57,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51007bca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:58:57, skipping insertion in model container [2022-01-10 03:58:57,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:58:57" (3/3) ... [2022-01-10 03:58:57,270 INFO L111 eAbstractionObserver]: Analyzing ICFG array2_pattern.c [2022-01-10 03:58:57,275 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:58:57,275 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:58:57,345 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:58:57,353 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-10 03:58:57,354 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:58:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 03:58:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 03:58:57,381 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:58:57,382 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:58:57,383 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:58:57,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:58:57,389 INFO L85 PathProgramCache]: Analyzing trace with hash -800294020, now seen corresponding path program 1 times [2022-01-10 03:58:57,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:58:57,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149647395] [2022-01-10 03:58:57,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:58:57,401 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:58:57,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:58:57,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:58:57,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 03:58:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:58:57,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:58:57,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:58:57,634 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-10 03:58:57,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:58:57,636 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:58:57,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149647395] [2022-01-10 03:58:57,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149647395] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:58:57,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:58:57,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:58:57,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374997890] [2022-01-10 03:58:57,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:58:57,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:58:57,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:58:57,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:58:57,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:58:57,676 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 03:58:57,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:58:57,695 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2022-01-10 03:58:57,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:58:57,697 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-10 03:58:57,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:58:57,703 INFO L225 Difference]: With dead ends: 47 [2022-01-10 03:58:57,703 INFO L226 Difference]: Without dead ends: 21 [2022-01-10 03:58:57,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:58:57,712 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:58:57,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:58:57,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-01-10 03:58:57,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-01-10 03:58:57,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 03:58:57,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-01-10 03:58:57,752 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2022-01-10 03:58:57,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:58:57,752 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-01-10 03:58:57,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 03:58:57,752 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-01-10 03:58:57,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 03:58:57,754 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:58:57,755 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:58:57,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 03:58:57,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:58:57,970 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:58:57,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:58:57,971 INFO L85 PathProgramCache]: Analyzing trace with hash -952637313, now seen corresponding path program 1 times [2022-01-10 03:58:57,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:58:57,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401167302] [2022-01-10 03:58:57,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:58:57,972 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:58:57,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:58:57,973 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:58:57,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 03:58:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:58:58,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 03:58:58,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:58:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:58:58,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:58:58,175 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:58:58,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401167302] [2022-01-10 03:58:58,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401167302] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:58:58,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:58:58,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 03:58:58,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283044463] [2022-01-10 03:58:58,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:58:58,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 03:58:58,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:58:58,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 03:58:58,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:58:58,179 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 03:58:58,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:58:58,225 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-01-10 03:58:58,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 03:58:58,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-01-10 03:58:58,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:58:58,228 INFO L225 Difference]: With dead ends: 26 [2022-01-10 03:58:58,228 INFO L226 Difference]: Without dead ends: 22 [2022-01-10 03:58:58,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:58:58,229 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:58:58,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:58:58,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-01-10 03:58:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-01-10 03:58:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 03:58:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-01-10 03:58:58,239 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 22 [2022-01-10 03:58:58,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:58:58,240 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-01-10 03:58:58,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 03:58:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-01-10 03:58:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 03:58:58,241 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:58:58,241 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:58:58,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 03:58:58,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:58:58,453 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:58:58,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:58:58,453 INFO L85 PathProgramCache]: Analyzing trace with hash -603190335, now seen corresponding path program 1 times [2022-01-10 03:58:58,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:58:58,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338662658] [2022-01-10 03:58:58,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:58:58,454 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:58:58,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:58:58,456 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:58:58,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 03:58:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:58:58,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 03:58:58,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:58:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 03:58:58,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:58:58,828 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:58:58,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338662658] [2022-01-10 03:58:58,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338662658] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:58:58,829 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:58:58,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 03:58:58,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128016439] [2022-01-10 03:58:58,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:58:58,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 03:58:58,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:58:58,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 03:58:58,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-01-10 03:58:58,836 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 03:58:58,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:58:58,854 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-01-10 03:58:58,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 03:58:58,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-01-10 03:58:58,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:58:58,857 INFO L225 Difference]: With dead ends: 43 [2022-01-10 03:58:58,858 INFO L226 Difference]: Without dead ends: 27 [2022-01-10 03:58:58,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-01-10 03:58:58,861 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:58:58,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 35 Unchecked, 0.0s Time] [2022-01-10 03:58:58,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-10 03:58:58,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-10 03:58:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 03:58:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-01-10 03:58:58,872 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2022-01-10 03:58:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:58:58,873 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-01-10 03:58:58,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 03:58:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-01-10 03:58:58,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 03:58:58,874 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:58:58,874 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:58:58,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 03:58:59,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:58:59,085 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:58:59,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:58:59,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1366149955, now seen corresponding path program 1 times [2022-01-10 03:58:59,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:58:59,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514909562] [2022-01-10 03:58:59,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:58:59,086 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:58:59,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:58:59,087 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:58:59,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 03:58:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:58:59,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-10 03:58:59,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:58:59,415 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 11 treesize of output 9 [2022-01-10 03:58:59,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:58:59,534 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-01-10 03:58:59,545 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 30 treesize of output 30 [2022-01-10 03:58:59,563 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2022-01-10 03:58:59,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2022-01-10 03:59:00,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:00,758 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 87 [2022-01-10 03:59:00,771 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 78 treesize of output 74 [2022-01-10 03:59:00,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 03:59:00,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 27 [2022-01-10 03:59:00,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 03:59:00,815 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2022-01-10 03:59:01,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 03:59:01,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 03:59:01,750 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 27 [2022-01-10 03:59:01,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:59:01,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:59:02,399 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_59 (Array (_ BitVec 64) (_ BitVec 32)))) (= (_ bv0 64) (let ((.cse4 ((_ sign_extend 16) |c_ULTIMATE.start_main_~index~0#1|))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse6 (bvadd (bvmul (_ bv4 64) ((_ sign_extend 48) |c_ULTIMATE.start_main_~index~0#1|)) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (store .cse5 .cse6 (bvadd (bvmul .cse4 (bvmul |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) (select .cse5 .cse6))))))) (let ((.cse0 (let ((.cse3 (bvadd (bvmul (_ bv4 64) c_~ARR_SIZE~0) (bvmul (_ bv4 64) (bvneg ((_ sign_extend 32) .cse4))) (_ bv18446744073709551612 64) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_59) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse3 (bvadd (select (select .cse2 |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse3) (bvmul |c_ULTIMATE.start_main_~num~0#1| .cse4))))) (.cse1 (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64)))) (bvadd ((_ sign_extend 32) (select .cse0 (bvadd .cse1 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) ((_ sign_extend 32) (select (select (store .cse2 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse0) |c_ULTIMATE.start_main_~#array1~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) |c_ULTIMATE.start_main_~sum~0#1|)))))) is different from false [2022-01-10 03:59:03,800 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:59:03,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514909562] [2022-01-10 03:59:03,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1514909562] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 03:59:03,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1077128843] [2022-01-10 03:59:03,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:59:03,801 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 03:59:03,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 03:59:03,804 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 03:59:03,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-01-10 03:59:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:59:04,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-10 03:59:04,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:59:04,344 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 11 treesize of output 9 [2022-01-10 03:59:04,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:04,633 INFO L353 Elim1Store]: treesize reduction 26, result has 40.9 percent of original size [2022-01-10 03:59:04,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2022-01-10 03:59:04,692 INFO L353 Elim1Store]: treesize reduction 26, result has 40.9 percent of original size [2022-01-10 03:59:04,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 54 [2022-01-10 03:59:04,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2022-01-10 03:59:04,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2022-01-10 03:59:04,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:04,994 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-01-10 03:59:05,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:05,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:05,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 03:59:05,047 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 62 [2022-01-10 03:59:05,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:05,065 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 26 treesize of output 15 [2022-01-10 03:59:07,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:07,148 INFO L353 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2022-01-10 03:59:07,149 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 98 [2022-01-10 03:59:07,196 INFO L353 Elim1Store]: treesize reduction 63, result has 7.4 percent of original size [2022-01-10 03:59:07,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 85 [2022-01-10 03:59:07,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 03:59:07,214 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 27 [2022-01-10 03:59:07,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 03:59:07,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2022-01-10 03:59:08,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 03:59:08,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 03:59:08,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:08,337 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 03:59:08,338 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 22 [2022-01-10 03:59:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:59:08,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:59:08,591 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_91 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_90 (Array (_ BitVec 64) (_ BitVec 32)))) (= (let ((.cse2 ((_ sign_extend 16) |c_ULTIMATE.start_main_~index~0#1|))) (let ((.cse3 (let ((.cse5 (bvadd (bvmul (_ bv4 64) c_~ARR_SIZE~0) (bvmul (_ bv4 64) (bvneg ((_ sign_extend 32) .cse2))) (_ bv18446744073709551612 64) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_91) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse5 (bvadd (bvmul |c_ULTIMATE.start_main_~num~0#1| .cse2) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_90) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse5))))) (.cse4 (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64)))) (bvadd ((_ sign_extend 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse1 (bvadd (bvmul (_ bv4 64) ((_ sign_extend 48) |c_ULTIMATE.start_main_~index~0#1|)) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (store .cse0 .cse1 (bvadd (bvmul .cse2 (bvmul |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) (select .cse0 .cse1))))) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse3) |c_ULTIMATE.start_main_~#array1~0#1.base|) (bvadd .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) ((_ sign_extend 32) (select .cse3 (bvadd .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) |c_ULTIMATE.start_main_~sum~0#1|))) (_ bv0 64))) is different from false [2022-01-10 03:59:12,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1077128843] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 03:59:12,038 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:59:12,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2022-01-10 03:59:12,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504402921] [2022-01-10 03:59:12,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:59:12,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-10 03:59:12,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:59:12,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-10 03:59:12,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1027, Unknown=10, NotChecked=138, Total=1406 [2022-01-10 03:59:12,040 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 26 states have internal predecessors, (42), 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-10 03:59:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:59:13,496 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-01-10 03:59:13,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 03:59:13,496 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 26 states have internal predecessors, (42), 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) Word has length 26 [2022-01-10 03:59:13,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:59:13,497 INFO L225 Difference]: With dead ends: 46 [2022-01-10 03:59:13,497 INFO L226 Difference]: Without dead ends: 42 [2022-01-10 03:59:13,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=304, Invalid=1416, Unknown=10, NotChecked=162, Total=1892 [2022-01-10 03:59:13,499 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:59:13,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 143 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-01-10 03:59:13,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-10 03:59:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-01-10 03:59:13,504 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), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:59:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-01-10 03:59:13,505 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 26 [2022-01-10 03:59:13,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:59:13,506 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-01-10 03:59:13,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 26 states have internal predecessors, (42), 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-10 03:59:13,506 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-01-10 03:59:13,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 03:59:13,507 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:59:13,507 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:59:13,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-01-10 03:59:13,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-01-10 03:59:13,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-01-10 03:59:13,918 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:59:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:59:13,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1336652411, now seen corresponding path program 2 times [2022-01-10 03:59:13,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:59:13,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508450089] [2022-01-10 03:59:13,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:59:13,919 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:59:13,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:59:13,920 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:59:13,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 03:59:14,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:59:14,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:59:14,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 03:59:14,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:59:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:59:14,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:59:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:59:15,018 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:59:15,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508450089] [2022-01-10 03:59:15,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508450089] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:59:15,018 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:59:15,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2022-01-10 03:59:15,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793774992] [2022-01-10 03:59:15,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:59:15,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 03:59:15,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:59:15,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 03:59:15,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-01-10 03:59:15,020 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 03:59:15,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:59:15,482 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-01-10 03:59:15,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 03:59:15,485 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 28 [2022-01-10 03:59:15,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:59:15,485 INFO L225 Difference]: With dead ends: 53 [2022-01-10 03:59:15,486 INFO L226 Difference]: Without dead ends: 35 [2022-01-10 03:59:15,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2022-01-10 03:59:15,487 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 51 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 03:59:15,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 117 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 39 Invalid, 0 Unknown, 44 Unchecked, 0.3s Time] [2022-01-10 03:59:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-10 03:59:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2022-01-10 03:59:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 03:59:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-01-10 03:59:15,492 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 28 [2022-01-10 03:59:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:59:15,492 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-01-10 03:59:15,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 03:59:15,492 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-01-10 03:59:15,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 03:59:15,493 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:59:15,493 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:59:15,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 03:59:15,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:59:15,707 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:59:15,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:59:15,708 INFO L85 PathProgramCache]: Analyzing trace with hash -178408891, now seen corresponding path program 3 times [2022-01-10 03:59:15,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:59:15,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490429528] [2022-01-10 03:59:15,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 03:59:15,709 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:59:15,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:59:15,710 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:59:15,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 03:59:15,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-10 03:59:15,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:59:15,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 03:59:15,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:59:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:59:16,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:59:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:59:16,640 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:59:16,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490429528] [2022-01-10 03:59:16,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490429528] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:59:16,640 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:59:16,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2022-01-10 03:59:16,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122480557] [2022-01-10 03:59:16,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:59:16,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 03:59:16,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:59:16,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 03:59:16,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-01-10 03:59:16,642 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 03:59:16,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:59:16,764 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-01-10 03:59:16,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 03:59:16,765 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 28 [2022-01-10 03:59:16,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:59:16,766 INFO L225 Difference]: With dead ends: 49 [2022-01-10 03:59:16,766 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 03:59:16,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2022-01-10 03:59:16,767 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:59:16,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 89 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 58 Unchecked, 0.0s Time] [2022-01-10 03:59:16,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 03:59:16,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2022-01-10 03:59:16,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 03:59:16,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-01-10 03:59:16,772 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 28 [2022-01-10 03:59:16,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:59:16,772 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-01-10 03:59:16,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 03:59:16,773 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-01-10 03:59:16,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 03:59:16,773 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:59:16,773 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] [2022-01-10 03:59:16,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-01-10 03:59:16,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:59:16,980 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:59:16,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:59:16,980 INFO L85 PathProgramCache]: Analyzing trace with hash 400980999, now seen corresponding path program 4 times [2022-01-10 03:59:16,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:59:16,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302867828] [2022-01-10 03:59:16,981 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 03:59:16,981 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:59:16,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:59:16,982 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:59:16,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 03:59:17,216 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 03:59:17,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:59:17,226 WARN L261 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-10 03:59:17,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:59:17,334 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 11 treesize of output 9 [2022-01-10 03:59:17,451 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 42 treesize of output 25 [2022-01-10 03:59:17,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:17,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:17,755 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 59 [2022-01-10 03:59:19,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:19,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:19,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:19,529 INFO L353 Elim1Store]: treesize reduction 254, result has 24.6 percent of original size [2022-01-10 03:59:19,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 133 [2022-01-10 03:59:29,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:29,143 INFO L353 Elim1Store]: treesize reduction 64, result has 9.9 percent of original size [2022-01-10 03:59:29,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 165 treesize of output 80 [2022-01-10 03:59:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:59:29,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:59:36,412 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:59:36,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302867828] [2022-01-10 03:59:36,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [302867828] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 03:59:36,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1549953260] [2022-01-10 03:59:36,412 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 03:59:36,412 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 03:59:36,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 03:59:36,413 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 03:59:36,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-01-10 03:59:37,190 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 03:59:37,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:59:37,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-10 03:59:37,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:59:37,731 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 11 treesize of output 9 [2022-01-10 03:59:37,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:38,043 INFO L353 Elim1Store]: treesize reduction 26, result has 40.9 percent of original size [2022-01-10 03:59:38,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2022-01-10 03:59:38,111 INFO L353 Elim1Store]: treesize reduction 26, result has 40.9 percent of original size [2022-01-10 03:59:38,112 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 54 [2022-01-10 03:59:38,184 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2022-01-10 03:59:38,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:38,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 35 [2022-01-10 03:59:38,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:38,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 24 [2022-01-10 03:59:39,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:39,191 INFO L353 Elim1Store]: treesize reduction 26, result has 40.9 percent of original size [2022-01-10 03:59:39,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 76 [2022-01-10 03:59:39,322 INFO L353 Elim1Store]: treesize reduction 26, result has 40.9 percent of original size [2022-01-10 03:59:39,322 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-01-10 03:59:39,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:39,348 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2022-01-10 03:59:39,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:39,608 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2022-01-10 03:59:39,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 03:59:39,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:39,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:39,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:39,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:39,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:39,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 03:59:39,735 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 84 treesize of output 103 [2022-01-10 03:59:39,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:39,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:39,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:39,782 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 49 treesize of output 26 [2022-01-10 03:59:39,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:39,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:39,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:39,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 69 [2022-01-10 03:59:42,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:42,873 INFO L353 Elim1Store]: treesize reduction 36, result has 33.3 percent of original size [2022-01-10 03:59:42,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 130 [2022-01-10 03:59:42,965 INFO L353 Elim1Store]: treesize reduction 50, result has 26.5 percent of original size [2022-01-10 03:59:42,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 108 [2022-01-10 03:59:43,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:43,160 INFO L353 Elim1Store]: treesize reduction 143, result has 24.3 percent of original size [2022-01-10 03:59:43,160 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 75 [2022-01-10 03:59:43,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:43,896 INFO L353 Elim1Store]: treesize reduction 111, result has 25.5 percent of original size [2022-01-10 03:59:43,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 59 [2022-01-10 03:59:44,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:44,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:44,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 03:59:44,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:44,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 03:59:44,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:44,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:44,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:44,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:44,324 INFO L353 Elim1Store]: treesize reduction 312, result has 7.4 percent of original size [2022-01-10 03:59:44,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 107 treesize of output 117 [2022-01-10 03:59:44,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:44,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:44,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:44,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:44,562 INFO L353 Elim1Store]: treesize reduction 111, result has 25.5 percent of original size [2022-01-10 03:59:44,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 50 treesize of output 70 [2022-01-10 03:59:45,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:45,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:45,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:45,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:45,290 INFO L353 Elim1Store]: treesize reduction 143, result has 24.3 percent of original size [2022-01-10 03:59:45,290 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 64 treesize of output 86 [2022-01-10 03:59:55,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:55,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:55,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:55,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:55,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:59:55,898 INFO L353 Elim1Store]: treesize reduction 64, result has 9.9 percent of original size [2022-01-10 03:59:55,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 173 treesize of output 84 [2022-01-10 03:59:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:59:56,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:59:56,420 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_226 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_227 (Array (_ BitVec 64) (_ BitVec 32)))) (= (_ bv0 64) (let ((.cse6 ((_ sign_extend 16) |c_ULTIMATE.start_main_~index~0#1|))) (let ((.cse0 (let ((.cse7 (bvadd (bvmul (_ bv4 64) c_~ARR_SIZE~0) (bvmul (_ bv4 64) (bvneg ((_ sign_extend 32) .cse6))) (_ bv18446744073709551612 64) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse7 (bvadd (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse7) (bvmul |c_ULTIMATE.start_main_~num~0#1| .cse6)))))) (let ((.cse1 (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64))) (.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse5 (bvadd (bvmul (_ bv4 64) ((_ sign_extend 48) |c_ULTIMATE.start_main_~index~0#1|)) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (store .cse4 .cse5 (bvadd (bvmul .cse6 (bvmul |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) (select .cse4 .cse5))))) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse0) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (bvmul ((_ sign_extend 32) (_ bv1 32)) (_ bv4 64)))) (bvadd ((_ sign_extend 32) (select .cse0 (bvadd .cse1 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) ((_ sign_extend 32) (select .cse2 (bvadd .cse1 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) ((_ sign_extend 32) (select .cse2 (bvadd |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse3))) |c_ULTIMATE.start_main_~sum~0#1| ((_ sign_extend 32) (select .cse0 (bvadd |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse3))))))))) is different from false [2022-01-10 04:00:02,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1549953260] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 04:00:02,233 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:00:02,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 39 [2022-01-10 04:00:02,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078756459] [2022-01-10 04:00:02,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:00:02,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-10 04:00:02,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:00:02,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-10 04:00:02,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=1866, Unknown=10, NotChecked=90, Total=2256 [2022-01-10 04:00:02,235 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 34 states have internal predecessors, (50), 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-10 04:00:03,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:00:03,571 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-01-10 04:00:03,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-10 04:00:03,571 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 34 states have internal predecessors, (50), 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) Word has length 30 [2022-01-10 04:00:03,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:00:03,572 INFO L225 Difference]: With dead ends: 54 [2022-01-10 04:00:03,572 INFO L226 Difference]: Without dead ends: 50 [2022-01-10 04:00:03,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=331, Invalid=2213, Unknown=10, NotChecked=98, Total=2652 [2022-01-10 04:00:03,574 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:00:03,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 230 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 112 Unchecked, 0.1s Time] [2022-01-10 04:00:03,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-10 04:00:03,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-01-10 04:00:03,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 04:00:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-01-10 04:00:03,582 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 30 [2022-01-10 04:00:03,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:00:03,583 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-01-10 04:00:03,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 34 states have internal predecessors, (50), 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-10 04:00:03,583 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-01-10 04:00:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 04:00:03,584 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:00:03,584 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] [2022-01-10 04:00:03,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-01-10 04:00:03,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2022-01-10 04:00:03,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-01-10 04:00:03,988 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:00:03,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:00:03,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1151083191, now seen corresponding path program 5 times [2022-01-10 04:00:03,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:00:03,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719863515] [2022-01-10 04:00:03,989 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 04:00:03,989 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:00:03,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:00:03,990 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:00:03,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 04:00:04,124 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-10 04:00:04,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 04:00:04,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-10 04:00:04,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:00:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:00:04,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:00:04,994 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 04:00:04,994 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:00:04,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719863515] [2022-01-10 04:00:04,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719863515] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 04:00:04,995 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:00:04,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2022-01-10 04:00:04,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047021156] [2022-01-10 04:00:04,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:00:04,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 04:00:04,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:00:04,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 04:00:04,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2022-01-10 04:00:04,996 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 04:00:05,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:00:05,240 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-01-10 04:00:05,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 04:00:05,240 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 32 [2022-01-10 04:00:05,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:00:05,241 INFO L225 Difference]: With dead ends: 67 [2022-01-10 04:00:05,241 INFO L226 Difference]: Without dead ends: 55 [2022-01-10 04:00:05,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2022-01-10 04:00:05,242 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:00:05,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 147 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 38 Unchecked, 0.1s Time] [2022-01-10 04:00:05,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-10 04:00:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-01-10 04:00:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 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-10 04:00:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-01-10 04:00:05,251 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 32 [2022-01-10 04:00:05,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:00:05,251 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-01-10 04:00:05,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 04:00:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-01-10 04:00:05,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 04:00:05,252 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:00:05,252 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] [2022-01-10 04:00:05,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 04:00:05,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:00:05,472 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:00:05,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:00:05,473 INFO L85 PathProgramCache]: Analyzing trace with hash -475590135, now seen corresponding path program 6 times [2022-01-10 04:00:05,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:00:05,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897558018] [2022-01-10 04:00:05,473 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-10 04:00:05,473 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:00:05,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:00:05,474 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:00:05,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 04:00:05,662 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-10 04:00:05,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 04:00:05,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 04:00:05,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:00:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:00:06,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:00:06,550 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:00:06,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897558018] [2022-01-10 04:00:06,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897558018] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 04:00:06,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1235186219] [2022-01-10 04:00:06,550 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-10 04:00:06,550 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 04:00:06,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 04:00:06,551 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 04:00:06,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-01-10 04:00:06,838 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-10 04:00:06,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 04:00:06,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-10 04:00:06,852 INFO L286 TraceCheckSpWp]: Computing forward predicates...