/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/verifythis/duplets.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7968f31 [2022-03-17 20:19:18,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-17 20:19:18,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-17 20:19:18,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-17 20:19:18,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-17 20:19:18,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-17 20:19:18,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-17 20:19:18,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-17 20:19:18,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-17 20:19:18,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-17 20:19:18,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-17 20:19:18,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-17 20:19:18,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-17 20:19:18,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-17 20:19:18,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-17 20:19:18,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-17 20:19:18,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-17 20:19:18,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-17 20:19:18,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-17 20:19:18,592 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-17 20:19:18,594 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-17 20:19:18,594 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-17 20:19:18,595 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-17 20:19:18,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-17 20:19:18,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-17 20:19:18,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-17 20:19:18,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-17 20:19:18,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-17 20:19:18,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-17 20:19:18,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-17 20:19:18,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-17 20:19:18,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-17 20:19:18,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-17 20:19:18,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-17 20:19:18,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-17 20:19:18,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-17 20:19:18,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-17 20:19:18,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-17 20:19:18,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-17 20:19:18,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-17 20:19:18,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-17 20:19:18,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-17 20:19:18,609 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-03-17 20:19:18,629 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-17 20:19:18,629 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-17 20:19:18,630 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-17 20:19:18,630 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-17 20:19:18,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-17 20:19:18,631 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-17 20:19:18,631 INFO L138 SettingsManager]: * Use SBE=true [2022-03-17 20:19:18,631 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-17 20:19:18,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-17 20:19:18,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-17 20:19:18,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-17 20:19:18,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-17 20:19:18,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-17 20:19:18,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-17 20:19:18,632 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-17 20:19:18,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-17 20:19:18,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-17 20:19:18,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-17 20:19:18,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-17 20:19:18,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 20:19:18,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-17 20:19:18,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-17 20:19:18,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-17 20:19:18,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-17 20:19:18,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-17 20:19:18,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-17 20:19:18,634 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-03-17 20:19:18,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-03-17 20:19:18,634 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-17 20:19:18,635 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-03-17 20:19:18,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-17 20:19:18,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-17 20:19:18,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-17 20:19:18,868 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-17 20:19:18,868 INFO L275 PluginConnector]: CDTParser initialized [2022-03-17 20:19:18,869 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/duplets.c [2022-03-17 20:19:18,915 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e34ca176c/889976db5d1e4770b6253ac1445e4e3b/FLAG19b84aa99 [2022-03-17 20:19:19,307 INFO L306 CDTParser]: Found 1 translation units. [2022-03-17 20:19:19,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c [2022-03-17 20:19:19,314 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e34ca176c/889976db5d1e4770b6253ac1445e4e3b/FLAG19b84aa99 [2022-03-17 20:19:19,331 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e34ca176c/889976db5d1e4770b6253ac1445e4e3b [2022-03-17 20:19:19,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-17 20:19:19,334 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-17 20:19:19,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-17 20:19:19,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-17 20:19:19,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-17 20:19:19,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:19:19" (1/1) ... [2022-03-17 20:19:19,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35282b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:19, skipping insertion in model container [2022-03-17 20:19:19,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:19:19" (1/1) ... [2022-03-17 20:19:19,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-17 20:19:19,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-17 20:19:19,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c[485,498] [2022-03-17 20:19:19,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 20:19:19,550 INFO L203 MainTranslator]: Completed pre-run [2022-03-17 20:19:19,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c[485,498] [2022-03-17 20:19:19,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 20:19:19,591 INFO L208 MainTranslator]: Completed translation [2022-03-17 20:19:19,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:19 WrapperNode [2022-03-17 20:19:19,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-17 20:19:19,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-17 20:19:19,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-17 20:19:19,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-17 20:19:19,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:19" (1/1) ... [2022-03-17 20:19:19,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:19" (1/1) ... [2022-03-17 20:19:19,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:19" (1/1) ... [2022-03-17 20:19:19,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:19" (1/1) ... [2022-03-17 20:19:19,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:19" (1/1) ... [2022-03-17 20:19:19,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:19" (1/1) ... [2022-03-17 20:19:19,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:19" (1/1) ... [2022-03-17 20:19:19,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-17 20:19:19,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-17 20:19:19,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-17 20:19:19,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-17 20:19:19,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:19" (1/1) ... [2022-03-17 20:19:19,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 20:19:19,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 20:19:19,704 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-03-17 20:19:19,706 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-03-17 20:19:19,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-17 20:19:19,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-17 20:19:19,747 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-17 20:19:19,748 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-17 20:19:19,748 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-17 20:19:19,748 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2022-03-17 20:19:19,749 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2022-03-17 20:19:19,749 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-17 20:19:19,750 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-03-17 20:19:19,751 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-03-17 20:19:19,751 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-03-17 20:19:19,751 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-17 20:19:19,751 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-17 20:19:19,751 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-17 20:19:19,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-17 20:19:19,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-17 20:19:19,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-17 20:19:19,751 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-17 20:19:19,751 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2022-03-17 20:19:19,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-17 20:19:19,751 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2022-03-17 20:19:19,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-17 20:19:19,752 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-17 20:19:19,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-17 20:19:19,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-17 20:19:19,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-03-17 20:19:19,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-17 20:19:19,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-17 20:19:19,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-17 20:19:19,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-17 20:19:19,813 INFO L234 CfgBuilder]: Building ICFG [2022-03-17 20:19:19,828 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-17 20:19:20,071 INFO L275 CfgBuilder]: Performing block encoding [2022-03-17 20:19:20,080 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-17 20:19:20,080 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-17 20:19:20,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 08:19:20 BoogieIcfgContainer [2022-03-17 20:19:20,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-17 20:19:20,082 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-17 20:19:20,082 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-17 20:19:20,084 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-17 20:19:20,087 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 08:19:20" (1/1) ... [2022-03-17 20:19:20,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 08:19:20 BasicIcfg [2022-03-17 20:19:20,120 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-17 20:19:20,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-17 20:19:20,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-17 20:19:20,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-17 20:19:20,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 08:19:19" (1/4) ... [2022-03-17 20:19:20,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e4d86a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 08:19:20, skipping insertion in model container [2022-03-17 20:19:20,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:19" (2/4) ... [2022-03-17 20:19:20,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e4d86a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 08:19:20, skipping insertion in model container [2022-03-17 20:19:20,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 08:19:20" (3/4) ... [2022-03-17 20:19:20,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e4d86a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 08:19:20, skipping insertion in model container [2022-03-17 20:19:20,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 08:19:20" (4/4) ... [2022-03-17 20:19:20,129 INFO L111 eAbstractionObserver]: Analyzing ICFG duplets.cqvasr [2022-03-17 20:19:20,134 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-17 20:19:20,134 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-17 20:19:20,174 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-17 20:19:20,180 INFO L340 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=FINITE_AUTOMATA, 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 [2022-03-17 20:19:20,180 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-17 20:19:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-03-17 20:19:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-17 20:19:20,197 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:19:20,198 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:19:20,199 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:19:20,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:19:20,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1613559281, now seen corresponding path program 1 times [2022-03-17 20:19:20,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:19:20,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202567766] [2022-03-17 20:19:20,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:20,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:19:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:20,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:19:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:20,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:20,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:19:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:20,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:19:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:20,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:19:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:20,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:20,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:19:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:20,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:19:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 20:19:20,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:19:20,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202567766] [2022-03-17 20:19:20,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202567766] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 20:19:20,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 20:19:20,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-17 20:19:20,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433662466] [2022-03-17 20:19:20,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 20:19:20,474 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-17 20:19:20,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:19:20,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-17 20:19:20,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-17 20:19:20,493 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-03-17 20:19:20,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:19:20,623 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2022-03-17 20:19:20,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 20:19:20,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2022-03-17 20:19:20,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:19:20,632 INFO L225 Difference]: With dead ends: 113 [2022-03-17 20:19:20,632 INFO L226 Difference]: Without dead ends: 56 [2022-03-17 20:19:20,634 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-03-17 20:19:20,637 INFO L912 BasicCegarLoop]: 53 mSDtfsCounter, 59 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 20:19:20,637 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 55 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 20:19:20,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-03-17 20:19:20,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2022-03-17 20:19:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-03-17 20:19:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-03-17 20:19:20,666 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 49 [2022-03-17 20:19:20,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:19:20,667 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-03-17 20:19:20,667 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-03-17 20:19:20,667 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-03-17 20:19:20,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-17 20:19:20,669 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:19:20,669 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:19:20,669 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-17 20:19:20,670 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:19:20,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:19:20,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1068751152, now seen corresponding path program 1 times [2022-03-17 20:19:20,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:19:20,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262338712] [2022-03-17 20:19:20,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:20,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:19:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:20,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:19:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:20,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:20,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:19:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:20,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:19:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:20,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:19:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:20,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:20,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:19:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:20,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:19:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-17 20:19:20,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:19:20,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262338712] [2022-03-17 20:19:20,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262338712] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:19:20,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592009182] [2022-03-17 20:19:20,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:20,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:19:20,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 20:19:20,981 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 20:19:20,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-17 20:19:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:21,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-17 20:19:21,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 20:19:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-17 20:19:21,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 20:19:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-17 20:19:21,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592009182] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 20:19:21,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 20:19:21,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 17 [2022-03-17 20:19:21,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297509098] [2022-03-17 20:19:21,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 20:19:21,612 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-17 20:19:21,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:19:21,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-17 20:19:21,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-03-17 20:19:21,613 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 17 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 8 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2022-03-17 20:19:22,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:19:22,070 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2022-03-17 20:19:22,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-17 20:19:22,070 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 8 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 49 [2022-03-17 20:19:22,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:19:22,072 INFO L225 Difference]: With dead ends: 84 [2022-03-17 20:19:22,072 INFO L226 Difference]: Without dead ends: 63 [2022-03-17 20:19:22,072 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2022-03-17 20:19:22,073 INFO L912 BasicCegarLoop]: 42 mSDtfsCounter, 109 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-17 20:19:22,074 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 58 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-17 20:19:22,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-03-17 20:19:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2022-03-17 20:19:22,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-03-17 20:19:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-03-17 20:19:22,080 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 49 [2022-03-17 20:19:22,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:19:22,081 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-03-17 20:19:22,081 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 8 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2022-03-17 20:19:22,081 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-03-17 20:19:22,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-17 20:19:22,082 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:19:22,082 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:19:22,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-17 20:19:22,299 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:19:22,300 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:19:22,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:19:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1304641222, now seen corresponding path program 1 times [2022-03-17 20:19:22,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:19:22,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577298800] [2022-03-17 20:19:22,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:22,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:19:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:22,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:19:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:22,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:22,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:19:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:22,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:19:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:22,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:19:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:22,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:22,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:19:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:22,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:19:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:22,451 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 20:19:22,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:19:22,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577298800] [2022-03-17 20:19:22,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577298800] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 20:19:22,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 20:19:22,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-17 20:19:22,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143309686] [2022-03-17 20:19:22,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 20:19:22,452 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-17 20:19:22,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:19:22,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-17 20:19:22,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-17 20:19:22,453 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-17 20:19:22,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:19:22,690 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-03-17 20:19:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-17 20:19:22,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 50 [2022-03-17 20:19:22,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:19:22,694 INFO L225 Difference]: With dead ends: 75 [2022-03-17 20:19:22,694 INFO L226 Difference]: Without dead ends: 73 [2022-03-17 20:19:22,694 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-03-17 20:19:22,697 INFO L912 BasicCegarLoop]: 51 mSDtfsCounter, 81 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 20:19:22,697 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 61 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-17 20:19:22,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-03-17 20:19:22,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2022-03-17 20:19:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-03-17 20:19:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2022-03-17 20:19:22,715 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 50 [2022-03-17 20:19:22,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:19:22,715 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2022-03-17 20:19:22,715 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-17 20:19:22,716 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-03-17 20:19:22,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-17 20:19:22,716 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:19:22,716 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:19:22,717 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-17 20:19:22,717 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:19:22,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:19:22,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1610834198, now seen corresponding path program 1 times [2022-03-17 20:19:22,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:19:22,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331185151] [2022-03-17 20:19:22,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:22,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:19:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:22,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:19:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:22,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:22,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:19:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:22,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:19:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:22,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:19:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:23,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:23,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:19:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:23,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:19:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-17 20:19:23,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:19:23,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331185151] [2022-03-17 20:19:23,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331185151] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:19:23,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019605790] [2022-03-17 20:19:23,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:23,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:19:23,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 20:19:23,080 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 20:19:23,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-17 20:19:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:23,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-17 20:19:23,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 20:19:23,367 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-17 20:19:23,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 20:19:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-17 20:19:23,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019605790] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-17 20:19:23,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-17 20:19:23,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15, 12] total 25 [2022-03-17 20:19:23,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923658432] [2022-03-17 20:19:23,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 20:19:23,786 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-17 20:19:23,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:19:23,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-17 20:19:23,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2022-03-17 20:19:23,787 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-03-17 20:19:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:19:23,905 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2022-03-17 20:19:23,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-17 20:19:23,905 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 52 [2022-03-17 20:19:23,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:19:23,909 INFO L225 Difference]: With dead ends: 104 [2022-03-17 20:19:23,909 INFO L226 Difference]: Without dead ends: 70 [2022-03-17 20:19:23,910 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2022-03-17 20:19:23,912 INFO L912 BasicCegarLoop]: 58 mSDtfsCounter, 43 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 20:19:23,915 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 464 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 20:19:23,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-03-17 20:19:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-03-17 20:19:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-03-17 20:19:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-03-17 20:19:23,931 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 52 [2022-03-17 20:19:23,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:19:23,932 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-03-17 20:19:23,932 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-03-17 20:19:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-03-17 20:19:23,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-03-17 20:19:23,936 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:19:23,936 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:19:23,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-17 20:19:24,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-17 20:19:24,148 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:19:24,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:19:24,148 INFO L85 PathProgramCache]: Analyzing trace with hash -58927682, now seen corresponding path program 1 times [2022-03-17 20:19:24,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:19:24,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356531696] [2022-03-17 20:19:24,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:24,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:19:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:24,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:19:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:24,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:24,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:19:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:24,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:19:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:24,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:19:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:24,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:24,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:19:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:24,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:19:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 20:19:24,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:19:24,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356531696] [2022-03-17 20:19:24,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356531696] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:19:24,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074176504] [2022-03-17 20:19:24,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:24,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:19:24,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 20:19:24,212 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 20:19:24,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-17 20:19:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:24,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-17 20:19:24,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 20:19:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 20:19:24,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 20:19:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 20:19:24,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074176504] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 20:19:24,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 20:19:24,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2022-03-17 20:19:24,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954859077] [2022-03-17 20:19:24,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 20:19:24,410 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 20:19:24,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:19:24,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 20:19:24,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-17 20:19:24,427 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-17 20:19:24,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:19:24,593 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2022-03-17 20:19:24,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 20:19:24,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2022-03-17 20:19:24,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:19:24,594 INFO L225 Difference]: With dead ends: 88 [2022-03-17 20:19:24,594 INFO L226 Difference]: Without dead ends: 67 [2022-03-17 20:19:24,595 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-03-17 20:19:24,595 INFO L912 BasicCegarLoop]: 47 mSDtfsCounter, 65 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 20:19:24,595 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 53 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 20:19:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-03-17 20:19:24,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-03-17 20:19:24,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-03-17 20:19:24,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-03-17 20:19:24,609 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 55 [2022-03-17 20:19:24,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:19:24,609 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-03-17 20:19:24,610 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-17 20:19:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-03-17 20:19:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-17 20:19:24,611 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:19:24,611 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:19:24,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-17 20:19:24,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:19:24,824 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:19:24,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:19:24,824 INFO L85 PathProgramCache]: Analyzing trace with hash 925124550, now seen corresponding path program 1 times [2022-03-17 20:19:24,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:19:24,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855637244] [2022-03-17 20:19:24,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:24,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:19:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:24,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:19:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:24,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:24,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:19:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:24,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:19:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:24,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:19:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:24,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:24,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:19:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:24,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:19:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:25,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-17 20:19:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:25,063 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 20:19:25,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:19:25,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855637244] [2022-03-17 20:19:25,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855637244] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:19:25,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348313696] [2022-03-17 20:19:25,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:25,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:19:25,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 20:19:25,065 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 20:19:25,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-17 20:19:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:25,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-17 20:19:25,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 20:19:25,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-17 20:19:25,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-03-17 20:19:25,332 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-17 20:19:25,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-03-17 20:19:25,341 INFO L390 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 7 treesize of output 5 [2022-03-17 20:19:25,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-03-17 20:19:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 20:19:25,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 20:19:25,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348313696] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 20:19:25,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 20:19:25,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 25 [2022-03-17 20:19:25,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767237265] [2022-03-17 20:19:25,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 20:19:25,465 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-17 20:19:25,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:19:25,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-17 20:19:25,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2022-03-17 20:19:25,466 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-03-17 20:19:25,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:19:25,638 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2022-03-17 20:19:25,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-17 20:19:25,638 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2022-03-17 20:19:25,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:19:25,639 INFO L225 Difference]: With dead ends: 85 [2022-03-17 20:19:25,639 INFO L226 Difference]: Without dead ends: 83 [2022-03-17 20:19:25,640 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2022-03-17 20:19:25,640 INFO L912 BasicCegarLoop]: 56 mSDtfsCounter, 50 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 20:19:25,641 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 441 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 20:19:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-03-17 20:19:25,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2022-03-17 20:19:25,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 50 states have internal predecessors, (56), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-03-17 20:19:25,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2022-03-17 20:19:25,646 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 57 [2022-03-17 20:19:25,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:19:25,646 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2022-03-17 20:19:25,646 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-03-17 20:19:25,646 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2022-03-17 20:19:25,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-17 20:19:25,647 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:19:25,647 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:19:25,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-17 20:19:25,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:19:25,868 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:19:25,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:19:25,868 INFO L85 PathProgramCache]: Analyzing trace with hash 926048071, now seen corresponding path program 1 times [2022-03-17 20:19:25,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:19:25,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500855415] [2022-03-17 20:19:25,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:25,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:19:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:25,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:19:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:25,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:25,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:19:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:25,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:19:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:25,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:19:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:25,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:25,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:19:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:25,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:19:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:25,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-17 20:19:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 20:19:26,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:19:26,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500855415] [2022-03-17 20:19:26,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500855415] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 20:19:26,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 20:19:26,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-17 20:19:26,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427628559] [2022-03-17 20:19:26,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 20:19:26,011 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-17 20:19:26,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:19:26,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-17 20:19:26,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-03-17 20:19:26,012 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-03-17 20:19:26,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:19:26,408 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2022-03-17 20:19:26,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-17 20:19:26,408 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2022-03-17 20:19:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:19:26,409 INFO L225 Difference]: With dead ends: 106 [2022-03-17 20:19:26,409 INFO L226 Difference]: Without dead ends: 92 [2022-03-17 20:19:26,409 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-03-17 20:19:26,410 INFO L912 BasicCegarLoop]: 40 mSDtfsCounter, 111 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-17 20:19:26,410 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 56 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-17 20:19:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-03-17 20:19:26,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2022-03-17 20:19:26,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 57 states have internal predecessors, (65), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-03-17 20:19:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2022-03-17 20:19:26,416 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 57 [2022-03-17 20:19:26,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:19:26,416 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2022-03-17 20:19:26,416 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-03-17 20:19:26,416 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2022-03-17 20:19:26,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-17 20:19:26,417 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:19:26,417 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:19:26,417 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-17 20:19:26,417 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:19:26,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:19:26,417 INFO L85 PathProgramCache]: Analyzing trace with hash -984079512, now seen corresponding path program 2 times [2022-03-17 20:19:26,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:19:26,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727070887] [2022-03-17 20:19:26,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:26,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:19:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:26,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:19:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:26,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:26,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:19:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:26,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:19:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:26,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:19:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:26,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:26,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:19:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:26,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:19:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-03-17 20:19:27,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:19:27,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727070887] [2022-03-17 20:19:27,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727070887] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:19:27,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076223272] [2022-03-17 20:19:27,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 20:19:27,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:19:27,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 20:19:27,183 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 20:19:27,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-17 20:19:27,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 20:19:27,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 20:19:27,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-17 20:19:27,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 20:19:27,492 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-03-17 20:19:27,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-03-17 20:19:28,904 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-03-17 20:19:28,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 20:19:29,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076223272] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:19:29,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 20:19:29,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 33 [2022-03-17 20:19:29,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364519366] [2022-03-17 20:19:29,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 20:19:29,028 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-17 20:19:29,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:19:29,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-17 20:19:29,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1029, Unknown=1, NotChecked=0, Total=1122 [2022-03-17 20:19:29,029 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand has 33 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 12 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-03-17 20:19:38,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:19:38,063 INFO L93 Difference]: Finished difference Result 129 states and 161 transitions. [2022-03-17 20:19:38,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-17 20:19:38,063 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 12 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 58 [2022-03-17 20:19:38,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:19:38,064 INFO L225 Difference]: With dead ends: 129 [2022-03-17 20:19:38,064 INFO L226 Difference]: Without dead ends: 108 [2022-03-17 20:19:38,065 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=269, Invalid=2810, Unknown=1, NotChecked=0, Total=3080 [2022-03-17 20:19:38,066 INFO L912 BasicCegarLoop]: 51 mSDtfsCounter, 85 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 292 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-17 20:19:38,066 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 270 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 882 Invalid, 0 Unknown, 292 Unchecked, 0.4s Time] [2022-03-17 20:19:38,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-03-17 20:19:38,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2022-03-17 20:19:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 63 states have internal predecessors, (74), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-03-17 20:19:38,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2022-03-17 20:19:38,074 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 58 [2022-03-17 20:19:38,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:19:38,074 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2022-03-17 20:19:38,074 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 12 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-03-17 20:19:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-03-17 20:19:38,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-17 20:19:38,075 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:19:38,075 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:19:38,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-17 20:19:38,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:19:38,279 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:19:38,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:19:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1828813328, now seen corresponding path program 3 times [2022-03-17 20:19:38,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:19:38,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974799158] [2022-03-17 20:19:38,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:38,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:19:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:38,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:19:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:38,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:38,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:19:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:38,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:19:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:38,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:19:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:38,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:38,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:19:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:38,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:19:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 20:19:38,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:19:38,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974799158] [2022-03-17 20:19:38,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974799158] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:19:38,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354929553] [2022-03-17 20:19:38,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-17 20:19:38,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:19:38,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 20:19:38,368 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 20:19:38,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-17 20:19:38,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-17 20:19:38,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 20:19:38,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-17 20:19:38,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 20:19:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 20:19:38,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 20:19:38,611 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 20:19:38,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354929553] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 20:19:38,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 20:19:38,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 10 [2022-03-17 20:19:38,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598820304] [2022-03-17 20:19:38,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 20:19:38,612 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-17 20:19:38,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:19:38,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-17 20:19:38,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-03-17 20:19:38,613 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-17 20:19:38,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:19:38,962 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2022-03-17 20:19:38,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-17 20:19:38,962 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2022-03-17 20:19:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:19:38,964 INFO L225 Difference]: With dead ends: 145 [2022-03-17 20:19:38,964 INFO L226 Difference]: Without dead ends: 101 [2022-03-17 20:19:38,966 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2022-03-17 20:19:38,968 INFO L912 BasicCegarLoop]: 49 mSDtfsCounter, 68 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 20:19:38,969 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 59 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-17 20:19:38,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-03-17 20:19:38,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2022-03-17 20:19:38,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 69 states have internal predecessors, (82), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-03-17 20:19:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2022-03-17 20:19:38,978 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 61 [2022-03-17 20:19:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:19:38,979 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2022-03-17 20:19:38,979 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-17 20:19:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2022-03-17 20:19:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-17 20:19:38,980 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:19:38,980 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:19:38,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-17 20:19:39,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:19:39,187 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:19:39,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:19:39,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1290066965, now seen corresponding path program 1 times [2022-03-17 20:19:39,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:19:39,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306764070] [2022-03-17 20:19:39,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:39,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:19:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:19:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:19:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:19:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:19:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:19:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:19:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-17 20:19:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-03-17 20:19:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-17 20:19:39,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:19:39,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306764070] [2022-03-17 20:19:39,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306764070] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 20:19:39,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 20:19:39,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-17 20:19:39,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112861982] [2022-03-17 20:19:39,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 20:19:39,322 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-17 20:19:39,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:19:39,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-17 20:19:39,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-03-17 20:19:39,322 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-03-17 20:19:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:19:39,691 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2022-03-17 20:19:39,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-17 20:19:39,692 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2022-03-17 20:19:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:19:39,693 INFO L225 Difference]: With dead ends: 111 [2022-03-17 20:19:39,693 INFO L226 Difference]: Without dead ends: 109 [2022-03-17 20:19:39,693 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2022-03-17 20:19:39,693 INFO L912 BasicCegarLoop]: 42 mSDtfsCounter, 82 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-17 20:19:39,694 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 56 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-17 20:19:39,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-03-17 20:19:39,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2022-03-17 20:19:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 75 states have internal predecessors, (88), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2022-03-17 20:19:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2022-03-17 20:19:39,703 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 64 [2022-03-17 20:19:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:19:39,703 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2022-03-17 20:19:39,704 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-03-17 20:19:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-03-17 20:19:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-17 20:19:39,704 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:19:39,704 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:19:39,704 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-17 20:19:39,705 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:19:39,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:19:39,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1289143444, now seen corresponding path program 1 times [2022-03-17 20:19:39,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:19:39,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262681910] [2022-03-17 20:19:39,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:39,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:19:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:19:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:19:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:19:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:19:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:19:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:19:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-17 20:19:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-03-17 20:19:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-17 20:19:39,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:19:39,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262681910] [2022-03-17 20:19:39,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262681910] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 20:19:39,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 20:19:39,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-17 20:19:39,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201053634] [2022-03-17 20:19:39,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 20:19:39,791 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-17 20:19:39,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:19:39,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-17 20:19:39,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-17 20:19:39,792 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-03-17 20:19:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:19:40,049 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2022-03-17 20:19:40,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-17 20:19:40,049 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2022-03-17 20:19:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:19:40,050 INFO L225 Difference]: With dead ends: 118 [2022-03-17 20:19:40,050 INFO L226 Difference]: Without dead ends: 107 [2022-03-17 20:19:40,050 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-03-17 20:19:40,051 INFO L912 BasicCegarLoop]: 40 mSDtfsCounter, 77 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 20:19:40,051 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 50 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-17 20:19:40,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-03-17 20:19:40,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2022-03-17 20:19:40,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 75 states have internal predecessors, (87), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2022-03-17 20:19:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2022-03-17 20:19:40,059 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 64 [2022-03-17 20:19:40,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:19:40,059 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2022-03-17 20:19:40,059 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-03-17 20:19:40,059 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2022-03-17 20:19:40,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-17 20:19:40,059 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:19:40,060 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:19:40,060 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-17 20:19:40,060 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:19:40,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:19:40,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1636548555, now seen corresponding path program 1 times [2022-03-17 20:19:40,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:19:40,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246170294] [2022-03-17 20:19:40,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:40,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:19:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:40,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:19:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:40,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:40,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:19:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:40,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:19:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:40,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:19:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:40,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:40,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:19:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:40,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:19:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:40,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-03-17 20:19:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 20:19:40,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:19:40,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246170294] [2022-03-17 20:19:40,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246170294] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:19:40,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242840797] [2022-03-17 20:19:40,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:40,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:19:40,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 20:19:40,152 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 20:19:40,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-17 20:19:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:40,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-17 20:19:40,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 20:19:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-17 20:19:40,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 20:19:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 20:19:40,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242840797] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 20:19:40,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 20:19:40,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 9 [2022-03-17 20:19:40,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281340078] [2022-03-17 20:19:40,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 20:19:40,416 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-17 20:19:40,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:19:40,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-17 20:19:40,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-17 20:19:40,416 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-03-17 20:19:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:19:40,682 INFO L93 Difference]: Finished difference Result 174 states and 211 transitions. [2022-03-17 20:19:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-17 20:19:40,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 63 [2022-03-17 20:19:40,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:19:40,683 INFO L225 Difference]: With dead ends: 174 [2022-03-17 20:19:40,683 INFO L226 Difference]: Without dead ends: 112 [2022-03-17 20:19:40,684 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-03-17 20:19:40,684 INFO L912 BasicCegarLoop]: 46 mSDtfsCounter, 86 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 20:19:40,684 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 56 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-17 20:19:40,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-03-17 20:19:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2022-03-17 20:19:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.173913043478261) internal successors, (81), 72 states have internal predecessors, (81), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2022-03-17 20:19:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2022-03-17 20:19:40,699 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 63 [2022-03-17 20:19:40,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:19:40,699 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2022-03-17 20:19:40,700 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-03-17 20:19:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2022-03-17 20:19:40,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-03-17 20:19:40,700 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:19:40,700 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:19:40,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-17 20:19:40,901 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:19:40,901 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:19:40,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:19:40,902 INFO L85 PathProgramCache]: Analyzing trace with hash 937349773, now seen corresponding path program 2 times [2022-03-17 20:19:40,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:19:40,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793356054] [2022-03-17 20:19:40,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:40,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:19:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:40,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:19:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:40,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:40,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:19:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:40,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:19:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:40,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:19:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:40,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:40,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:19:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:40,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:19:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:41,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-03-17 20:19:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-03-17 20:19:41,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:19:41,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793356054] [2022-03-17 20:19:41,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793356054] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 20:19:41,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 20:19:41,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-17 20:19:41,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994405069] [2022-03-17 20:19:41,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 20:19:41,081 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-17 20:19:41,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:19:41,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-17 20:19:41,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-03-17 20:19:41,081 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-03-17 20:19:41,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:19:41,614 INFO L93 Difference]: Finished difference Result 126 states and 148 transitions. [2022-03-17 20:19:41,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-17 20:19:41,615 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-03-17 20:19:41,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:19:41,616 INFO L225 Difference]: With dead ends: 126 [2022-03-17 20:19:41,616 INFO L226 Difference]: Without dead ends: 108 [2022-03-17 20:19:41,616 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2022-03-17 20:19:41,616 INFO L912 BasicCegarLoop]: 49 mSDtfsCounter, 78 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-17 20:19:41,616 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 69 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-17 20:19:41,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-03-17 20:19:41,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2022-03-17 20:19:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 64 states have internal predecessors, (71), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-03-17 20:19:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2022-03-17 20:19:41,623 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 66 [2022-03-17 20:19:41,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:19:41,623 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2022-03-17 20:19:41,624 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-03-17 20:19:41,624 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2022-03-17 20:19:41,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-03-17 20:19:41,625 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:19:41,625 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:19:41,625 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-17 20:19:41,625 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:19:41,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:19:41,625 INFO L85 PathProgramCache]: Analyzing trace with hash -455253687, now seen corresponding path program 1 times [2022-03-17 20:19:41,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:19:41,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752513372] [2022-03-17 20:19:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:41,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:19:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:41,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:19:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:41,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:41,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:19:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:41,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:19:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:41,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:19:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:41,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:41,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:19:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:41,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:19:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:41,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-17 20:19:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:41,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-03-17 20:19:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:41,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-03-17 20:19:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-17 20:19:41,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:19:41,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752513372] [2022-03-17 20:19:41,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752513372] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:19:41,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753989726] [2022-03-17 20:19:41,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:41,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:19:41,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 20:19:41,848 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 20:19:41,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-17 20:19:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:41,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-17 20:19:41,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 20:19:41,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-17 20:19:42,063 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-03-17 20:19:42,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-03-17 20:19:42,085 INFO L356 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-03-17 20:19:42,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 71 [2022-03-17 20:19:42,102 INFO L390 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 8 treesize of output 7 [2022-03-17 20:19:42,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 6 [2022-03-17 20:19:42,193 INFO L390 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 18 treesize of output 14 [2022-03-17 20:19:42,228 INFO L390 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 11 treesize of output 10 [2022-03-17 20:19:42,270 INFO L390 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 8 treesize of output 7 [2022-03-17 20:19:42,886 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-17 20:19:42,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2022-03-17 20:19:42,889 INFO L390 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 24 treesize of output 20 [2022-03-17 20:19:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-03-17 20:19:42,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 20:19:43,065 INFO L356 Elim1Store]: treesize reduction 28, result has 33.3 percent of original size [2022-03-17 20:19:43,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 52 [2022-03-17 20:19:43,069 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-17 20:19:43,070 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2022-03-17 20:19:43,075 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-17 20:19:43,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 63 [2022-03-17 20:19:43,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 75 [2022-03-17 20:19:43,083 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-17 20:19:43,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 57 [2022-03-17 20:19:43,093 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-17 20:19:43,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 53 [2022-03-17 20:19:43,096 INFO L390 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 6 treesize of output 4 [2022-03-17 20:19:43,147 INFO L356 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2022-03-17 20:19:43,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 94 treesize of output 87 [2022-03-17 20:19:43,171 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-17 20:19:43,172 INFO L390 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 195 treesize of output 215 [2022-03-17 20:19:43,187 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-17 20:19:43,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 216 [2022-03-17 20:19:43,309 INFO L390 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 6 treesize of output 4 [2022-03-17 20:19:43,320 INFO L390 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 6 treesize of output 4 [2022-03-17 20:19:43,334 INFO L390 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 8 treesize of output 6 [2022-03-17 20:19:43,356 INFO L390 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-03-17 20:19:43,373 INFO L390 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 8 treesize of output 6 [2022-03-17 20:19:43,516 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-17 20:19:43,517 INFO L390 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 1 case distinctions, treesize of input 15 treesize of output 11 [2022-03-17 20:19:43,583 INFO L356 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-03-17 20:19:43,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 1 [2022-03-17 20:19:43,677 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-17 20:19:43,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 84 [2022-03-17 20:19:43,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-17 20:19:43,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 1 [2022-03-17 20:19:44,003 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-17 20:19:44,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 146 treesize of output 153 [2022-03-17 20:19:44,098 INFO L390 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 6 treesize of output 4 [2022-03-17 20:19:44,129 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-17 20:19:44,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 60 [2022-03-17 20:19:44,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-17 20:19:44,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 1 [2022-03-17 20:19:44,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 1 [2022-03-17 20:19:44,482 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-17 20:19:44,482 INFO L390 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 1 case distinctions, treesize of input 7 treesize of output 6 [2022-03-17 20:19:44,597 INFO L390 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 6 treesize of output 4 [2022-03-17 20:19:44,609 INFO L390 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 6 treesize of output 4 [2022-03-17 20:19:44,614 INFO L390 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 6 treesize of output 4 [2022-03-17 20:19:44,625 INFO L390 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 6 treesize of output 4 [2022-03-17 20:19:44,665 INFO L390 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 6 treesize of output 4 [2022-03-17 20:19:44,670 INFO L390 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 20 treesize of output 18 [2022-03-17 20:19:44,691 INFO L390 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 6 treesize of output 4 [2022-03-17 20:19:44,714 INFO L390 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 24 treesize of output 22 [2022-03-17 20:19:44,737 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-17 20:19:44,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 54 [2022-03-17 20:19:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-03-17 20:19:45,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753989726] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-17 20:19:45,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-17 20:19:45,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16, 11] total 27 [2022-03-17 20:19:45,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915546346] [2022-03-17 20:19:45,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 20:19:45,040 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-17 20:19:45,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:19:45,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-17 20:19:45,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=621, Unknown=4, NotChecked=0, Total=702 [2022-03-17 20:19:45,041 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-03-17 20:19:45,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:19:45,241 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2022-03-17 20:19:45,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-17 20:19:45,242 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 70 [2022-03-17 20:19:45,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:19:45,242 INFO L225 Difference]: With dead ends: 110 [2022-03-17 20:19:45,242 INFO L226 Difference]: Without dead ends: 108 [2022-03-17 20:19:45,243 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 143 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=827, Unknown=4, NotChecked=0, Total=930 [2022-03-17 20:19:45,243 INFO L912 BasicCegarLoop]: 59 mSDtfsCounter, 39 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 20:19:45,243 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 415 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 20:19:45,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-03-17 20:19:45,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2022-03-17 20:19:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.125) internal successors, (81), 75 states have internal predecessors, (81), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-03-17 20:19:45,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2022-03-17 20:19:45,250 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 70 [2022-03-17 20:19:45,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:19:45,250 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2022-03-17 20:19:45,250 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-03-17 20:19:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2022-03-17 20:19:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-03-17 20:19:45,251 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:19:45,251 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:19:45,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-17 20:19:45,467 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-17 20:19:45,468 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:19:45,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:19:45,468 INFO L85 PathProgramCache]: Analyzing trace with hash -633726750, now seen corresponding path program 4 times [2022-03-17 20:19:45,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:19:45,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148977968] [2022-03-17 20:19:45,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:19:45,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:19:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:45,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:19:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:45,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:45,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:19:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:45,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:19:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:46,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:19:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:46,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:19:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:46,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:19:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:46,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:19:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:19:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-03-17 20:19:48,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:19:48,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148977968] [2022-03-17 20:19:48,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148977968] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:19:48,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736329936] [2022-03-17 20:19:48,691 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-17 20:19:48,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:19:48,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 20:19:48,692 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 20:19:48,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-17 20:19:48,762 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-17 20:19:48,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 20:19:48,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-17 20:19:48,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 20:19:48,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-03-17 20:19:53,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-03-17 20:19:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-03-17 20:19:59,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 20:19:59,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736329936] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:19:59,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 20:19:59,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 46 [2022-03-17 20:19:59,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012128210] [2022-03-17 20:19:59,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 20:19:59,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-17 20:19:59,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:19:59,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-17 20:19:59,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1966, Unknown=4, NotChecked=0, Total=2162 [2022-03-17 20:19:59,355 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand has 46 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 39 states have internal predecessors, (68), 9 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2022-03-17 20:20:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:20:11,537 INFO L93 Difference]: Finished difference Result 167 states and 201 transitions. [2022-03-17 20:20:11,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-17 20:20:11,538 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 39 states have internal predecessors, (68), 9 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) Word has length 67 [2022-03-17 20:20:11,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:20:11,539 INFO L225 Difference]: With dead ends: 167 [2022-03-17 20:20:11,539 INFO L226 Difference]: Without dead ends: 133 [2022-03-17 20:20:11,540 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=550, Invalid=5760, Unknown=10, NotChecked=0, Total=6320 [2022-03-17 20:20:11,541 INFO L912 BasicCegarLoop]: 54 mSDtfsCounter, 159 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 2157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 326 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-17 20:20:11,541 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 253 Invalid, 2157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1719 Invalid, 0 Unknown, 326 Unchecked, 1.3s Time] [2022-03-17 20:20:11,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-03-17 20:20:11,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 115. [2022-03-17 20:20:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.1481481481481481) internal successors, (93), 84 states have internal predecessors, (93), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-03-17 20:20:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 135 transitions. [2022-03-17 20:20:11,551 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 135 transitions. Word has length 67 [2022-03-17 20:20:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:20:11,551 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 135 transitions. [2022-03-17 20:20:11,551 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 39 states have internal predecessors, (68), 9 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2022-03-17 20:20:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2022-03-17 20:20:11,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-03-17 20:20:11,552 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:20:11,552 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:20:11,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-17 20:20:11,767 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-17 20:20:11,767 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:20:11,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:20:11,768 INFO L85 PathProgramCache]: Analyzing trace with hash -516817935, now seen corresponding path program 1 times [2022-03-17 20:20:11,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:20:11,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973408804] [2022-03-17 20:20:11,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:20:11,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:20:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:11,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:20:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:11,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:20:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:11,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:20:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:11,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:20:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:11,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:20:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:11,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:20:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:11,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:20:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:11,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:20:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:12,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-03-17 20:20:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:12,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-03-17 20:20:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:12,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-03-17 20:20:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-17 20:20:12,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:20:12,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973408804] [2022-03-17 20:20:12,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973408804] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:20:12,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433496122] [2022-03-17 20:20:12,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:20:12,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:20:12,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 20:20:12,037 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 20:20:12,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-17 20:20:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:12,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-17 20:20:12,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 20:20:12,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-17 20:20:12,321 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-03-17 20:20:12,322 INFO L390 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 1 case distinctions, treesize of input 27 treesize of output 23 [2022-03-17 20:20:12,624 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-17 20:20:12,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2022-03-17 20:20:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-03-17 20:20:12,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 20:20:12,861 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-03-17 20:20:12,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 670 treesize of output 606 [2022-03-17 20:20:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-03-17 20:20:13,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433496122] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 20:20:13,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 20:20:13,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 11] total 31 [2022-03-17 20:20:13,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96597810] [2022-03-17 20:20:13,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 20:20:13,360 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-17 20:20:13,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:20:13,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-17 20:20:13,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2022-03-17 20:20:13,361 INFO L87 Difference]: Start difference. First operand 115 states and 135 transitions. Second operand has 31 states, 25 states have (on average 2.92) internal successors, (73), 27 states have internal predecessors, (73), 10 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) [2022-03-17 20:20:14,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:20:14,978 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2022-03-17 20:20:14,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-17 20:20:14,979 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 2.92) internal successors, (73), 27 states have internal predecessors, (73), 10 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) Word has length 73 [2022-03-17 20:20:14,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:20:14,980 INFO L225 Difference]: With dead ends: 181 [2022-03-17 20:20:14,980 INFO L226 Difference]: Without dead ends: 179 [2022-03-17 20:20:14,981 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 150 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=430, Invalid=3230, Unknown=0, NotChecked=0, Total=3660 [2022-03-17 20:20:14,981 INFO L912 BasicCegarLoop]: 48 mSDtfsCounter, 214 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 2098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-17 20:20:14,981 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 86 Invalid, 2098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1744 Invalid, 0 Unknown, 159 Unchecked, 0.8s Time] [2022-03-17 20:20:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-03-17 20:20:14,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 139. [2022-03-17 20:20:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 98 states have (on average 1.1428571428571428) internal successors, (112), 102 states have internal predecessors, (112), 24 states have call successors, (24), 14 states have call predecessors, (24), 16 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2022-03-17 20:20:14,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 161 transitions. [2022-03-17 20:20:14,990 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 161 transitions. Word has length 73 [2022-03-17 20:20:14,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:20:14,991 INFO L478 AbstractCegarLoop]: Abstraction has 139 states and 161 transitions. [2022-03-17 20:20:14,991 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 2.92) internal successors, (73), 27 states have internal predecessors, (73), 10 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) [2022-03-17 20:20:14,991 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 161 transitions. [2022-03-17 20:20:14,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-17 20:20:14,991 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:20:14,991 INFO L500 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:20:15,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-17 20:20:15,208 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-17 20:20:15,209 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:20:15,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:20:15,209 INFO L85 PathProgramCache]: Analyzing trace with hash -2020932442, now seen corresponding path program 1 times [2022-03-17 20:20:15,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:20:15,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635597906] [2022-03-17 20:20:15,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:20:15,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:20:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:15,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:20:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:15,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:20:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:15,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:20:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:15,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:20:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:15,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:20:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:15,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:20:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:15,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:20:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:15,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:20:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:15,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-17 20:20:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:15,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-03-17 20:20:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:15,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-03-17 20:20:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:15,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-03-17 20:20:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:15,591 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-03-17 20:20:15,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:20:15,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635597906] [2022-03-17 20:20:15,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635597906] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:20:15,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638482697] [2022-03-17 20:20:15,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:20:15,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:20:15,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 20:20:15,592 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 20:20:15,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-17 20:20:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:20:15,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 118 conjunts are in the unsatisfiable core [2022-03-17 20:20:15,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 20:20:15,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-03-17 20:20:15,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-17 20:20:18,007 WARN L855 $PredicateComparison]: unable to prove that (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (= (store |c_old(#memory_int)| |c_mkdup_#in~a.base| (store (store (select |c_old(#memory_int)| |c_mkdup_#in~a.base|) (+ |c_mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ (* mkdup_~j~0 4) |c_mkdup_#in~a.offset|) mkdup_~x~0)) |c_#memory_int|) (<= 0 mkdup_~i~0))) is different from true [2022-03-17 20:20:18,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-03-17 20:20:22,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-17 20:20:24,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-17 20:20:24,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2022-03-17 20:20:24,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-17 20:20:24,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-17 20:20:24,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 53 treesize of output 52 [2022-03-17 20:20:24,463 INFO L390 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 8 treesize of output 7 [2022-03-17 20:20:24,469 INFO L390 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 8 treesize of output 7 [2022-03-17 20:21:35,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-17 20:21:35,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-17 20:21:35,828 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-17 20:21:35,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 47 [2022-03-17 20:21:35,835 INFO L390 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 26 treesize of output 22 [2022-03-17 20:21:35,839 INFO L390 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 26 treesize of output 22 [2022-03-17 20:21:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-03-17 20:21:35,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 20:21:44,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-17 20:21:44,888 INFO L390 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 6 treesize of output 4 [2022-03-17 20:21:53,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638482697] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:21:53,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 20:21:53,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 39 [2022-03-17 20:21:53,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888789549] [2022-03-17 20:21:53,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 20:21:53,319 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-17 20:21:53,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:21:53,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-17 20:21:53,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2163, Unknown=20, NotChecked=94, Total=2450 [2022-03-17 20:21:53,320 INFO L87 Difference]: Start difference. First operand 139 states and 161 transitions. Second operand has 39 states, 31 states have (on average 2.032258064516129) internal successors, (63), 29 states have internal predecessors, (63), 13 states have call successors, (26), 6 states have call predecessors, (26), 8 states have return successors, (22), 12 states have call predecessors, (22), 12 states have call successors, (22) [2022-03-17 20:22:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:22:54,868 INFO L93 Difference]: Finished difference Result 189 states and 216 transitions. [2022-03-17 20:22:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-17 20:22:54,868 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 2.032258064516129) internal successors, (63), 29 states have internal predecessors, (63), 13 states have call successors, (26), 6 states have call predecessors, (26), 8 states have return successors, (22), 12 states have call predecessors, (22), 12 states have call successors, (22) Word has length 76 [2022-03-17 20:22:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:22:54,869 INFO L225 Difference]: With dead ends: 189 [2022-03-17 20:22:54,869 INFO L226 Difference]: Without dead ends: 119 [2022-03-17 20:22:54,870 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 99 SyntacticMatches, 10 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1379 ImplicationChecksByTransitivity, 155.5s TimeCoverageRelationStatistics Valid=405, Invalid=5249, Unknown=50, NotChecked=148, Total=5852 [2022-03-17 20:22:54,871 INFO L912 BasicCegarLoop]: 40 mSDtfsCounter, 99 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 297 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-17 20:22:54,871 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 196 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1210 Invalid, 0 Unknown, 297 Unchecked, 0.6s Time] [2022-03-17 20:22:54,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-03-17 20:22:54,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2022-03-17 20:22:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 85 states have internal predecessors, (93), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-03-17 20:22:54,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2022-03-17 20:22:54,880 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 76 [2022-03-17 20:22:54,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:22:54,880 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2022-03-17 20:22:54,880 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 2.032258064516129) internal successors, (63), 29 states have internal predecessors, (63), 13 states have call successors, (26), 6 states have call predecessors, (26), 8 states have return successors, (22), 12 states have call predecessors, (22), 12 states have call successors, (22) [2022-03-17 20:22:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2022-03-17 20:22:54,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-17 20:22:54,880 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:22:54,880 INFO L500 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:22:54,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-17 20:22:55,081 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-17 20:22:55,081 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:22:55,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:22:55,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1723575464, now seen corresponding path program 5 times [2022-03-17 20:22:55,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:22:55,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957407252] [2022-03-17 20:22:55,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:22:55,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:22:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:22:55,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:22:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:22:55,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:22:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:22:55,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:22:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:22:55,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:22:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:22:55,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:22:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:22:55,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:22:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:22:55,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:22:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:22:55,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:22:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:22:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 43 proven. 15 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-03-17 20:22:55,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:22:55,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957407252] [2022-03-17 20:22:55,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957407252] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:22:55,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686753456] [2022-03-17 20:22:55,165 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-17 20:22:55,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:22:55,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 20:22:55,176 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 20:22:55,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-17 20:22:55,249 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-17 20:22:55,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 20:22:55,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-17 20:22:55,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 20:22:55,334 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 43 proven. 15 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-03-17 20:22:55,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 20:22:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 43 proven. 15 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-03-17 20:22:55,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686753456] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 20:22:55,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 20:22:55,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 11 [2022-03-17 20:22:55,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788252888] [2022-03-17 20:22:55,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 20:22:55,438 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-17 20:22:55,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:22:55,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-17 20:22:55,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-03-17 20:22:55,439 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-17 20:22:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:22:55,766 INFO L93 Difference]: Finished difference Result 217 states and 256 transitions. [2022-03-17 20:22:55,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-17 20:22:55,767 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2022-03-17 20:22:55,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:22:55,767 INFO L225 Difference]: With dead ends: 217 [2022-03-17 20:22:55,768 INFO L226 Difference]: Without dead ends: 141 [2022-03-17 20:22:55,768 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-03-17 20:22:55,768 INFO L912 BasicCegarLoop]: 47 mSDtfsCounter, 110 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 20:22:55,769 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 55 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-17 20:22:55,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-03-17 20:22:55,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2022-03-17 20:22:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-03-17 20:22:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2022-03-17 20:22:55,779 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 76 [2022-03-17 20:22:55,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:22:55,780 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2022-03-17 20:22:55,781 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-17 20:22:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2022-03-17 20:22:55,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-03-17 20:22:55,781 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:22:55,781 INFO L500 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:22:55,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-17 20:22:55,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-17 20:22:55,995 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:22:55,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:22:55,996 INFO L85 PathProgramCache]: Analyzing trace with hash 181119312, now seen corresponding path program 6 times [2022-03-17 20:22:55,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:22:55,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044270964] [2022-03-17 20:22:55,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:22:55,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:22:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:22:56,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:22:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:22:56,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:22:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:22:56,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:22:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:22:56,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:22:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:22:56,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:22:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:22:56,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:22:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:22:56,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:22:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:22:56,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:22:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:23:01,047 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 14 proven. 83 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-03-17 20:23:01,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:23:01,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044270964] [2022-03-17 20:23:01,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044270964] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:23:01,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42288196] [2022-03-17 20:23:01,047 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-17 20:23:01,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:23:01,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 20:23:01,048 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 20:23:01,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-17 20:23:01,149 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-17 20:23:01,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 20:23:01,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 101 conjunts are in the unsatisfiable core [2022-03-17 20:23:01,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 20:23:01,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-03-17 20:23:12,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-03-17 20:23:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 81 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-03-17 20:23:28,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 20:23:28,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42288196] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:23:28,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 20:23:28,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 38] total 67 [2022-03-17 20:23:28,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141493296] [2022-03-17 20:23:28,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 20:23:28,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-03-17 20:23:28,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:23:28,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-03-17 20:23:28,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=4240, Unknown=10, NotChecked=0, Total=4556 [2022-03-17 20:23:28,485 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 67 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 59 states have internal predecessors, (94), 11 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) [2022-03-17 20:25:59,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:25:59,097 INFO L93 Difference]: Finished difference Result 166 states and 196 transitions. [2022-03-17 20:25:59,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-17 20:25:59,097 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 59 states have internal predecessors, (94), 11 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) Word has length 79 [2022-03-17 20:25:59,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:25:59,101 INFO L225 Difference]: With dead ends: 166 [2022-03-17 20:25:59,101 INFO L226 Difference]: Without dead ends: 132 [2022-03-17 20:25:59,104 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5200 ImplicationChecksByTransitivity, 177.4s TimeCoverageRelationStatistics Valid=1010, Invalid=16209, Unknown=73, NotChecked=0, Total=17292 [2022-03-17 20:25:59,104 INFO L912 BasicCegarLoop]: 44 mSDtfsCounter, 50 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 597 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-17 20:25:59,105 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 222 Invalid, 1918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1262 Invalid, 0 Unknown, 597 Unchecked, 1.1s Time] [2022-03-17 20:25:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-03-17 20:25:59,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2022-03-17 20:25:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 97 states have internal predecessors, (107), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-03-17 20:25:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2022-03-17 20:25:59,121 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 149 transitions. Word has length 79 [2022-03-17 20:25:59,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:25:59,121 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 149 transitions. [2022-03-17 20:25:59,121 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 59 states have internal predecessors, (94), 11 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) [2022-03-17 20:25:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2022-03-17 20:25:59,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-03-17 20:25:59,122 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:25:59,122 INFO L500 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:25:59,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-17 20:25:59,341 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:25:59,341 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:25:59,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:25:59,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1729343584, now seen corresponding path program 1 times [2022-03-17 20:25:59,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:25:59,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429000647] [2022-03-17 20:25:59,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:25:59,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:25:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:25:59,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:25:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:25:59,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:25:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:25:59,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:25:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:25:59,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:25:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:25:59,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:25:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:25:59,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:25:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:25:59,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:25:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:25:59,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:25:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:25:59,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-03-17 20:25:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:25:59,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-03-17 20:25:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:25:59,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-03-17 20:25:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:25:59,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-03-17 20:25:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:25:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-03-17 20:25:59,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:25:59,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429000647] [2022-03-17 20:25:59,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429000647] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:25:59,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535535686] [2022-03-17 20:25:59,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:25:59,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:25:59,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 20:25:59,740 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 20:25:59,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-17 20:25:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:25:59,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 86 conjunts are in the unsatisfiable core [2022-03-17 20:25:59,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 20:25:59,876 INFO L390 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 6 treesize of output 5 [2022-03-17 20:26:00,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-17 20:26:00,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-17 20:26:00,128 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-03-17 20:26:00,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 18 [2022-03-17 20:26:00,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-17 20:26:00,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-17 20:26:00,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2022-03-17 20:26:00,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-17 20:26:00,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 36 [2022-03-17 20:26:00,554 INFO L390 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 8 treesize of output 7 [2022-03-17 20:26:00,558 INFO L390 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 8 treesize of output 7 [2022-03-17 20:26:03,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-17 20:26:03,503 INFO L356 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-03-17 20:26:03,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 36 [2022-03-17 20:26:03,547 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-03-17 20:26:03,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 20:26:03,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535535686] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:26:03,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 20:26:03,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2022-03-17 20:26:03,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688871169] [2022-03-17 20:26:03,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 20:26:03,775 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-17 20:26:03,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:26:03,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-17 20:26:03,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2022-03-17 20:26:03,775 INFO L87 Difference]: Start difference. First operand 128 states and 149 transitions. Second operand has 29 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 10 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) [2022-03-17 20:26:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:26:09,097 INFO L93 Difference]: Finished difference Result 182 states and 207 transitions. [2022-03-17 20:26:09,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-17 20:26:09,097 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 10 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) Word has length 85 [2022-03-17 20:26:09,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:26:09,098 INFO L225 Difference]: With dead ends: 182 [2022-03-17 20:26:09,098 INFO L226 Difference]: Without dead ends: 121 [2022-03-17 20:26:09,099 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 114 SyntacticMatches, 12 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=335, Invalid=3445, Unknown=2, NotChecked=0, Total=3782 [2022-03-17 20:26:09,099 INFO L912 BasicCegarLoop]: 47 mSDtfsCounter, 158 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 268 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-17 20:26:09,099 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 210 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1171 Invalid, 0 Unknown, 268 Unchecked, 0.6s Time] [2022-03-17 20:26:09,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-03-17 20:26:09,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2022-03-17 20:26:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 86 states have internal predecessors, (92), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (16), 16 states have call predecessors, (16), 15 states have call successors, (16) [2022-03-17 20:26:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2022-03-17 20:26:09,112 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 85 [2022-03-17 20:26:09,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:26:09,113 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2022-03-17 20:26:09,113 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 10 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) [2022-03-17 20:26:09,113 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2022-03-17 20:26:09,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-17 20:26:09,115 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:26:09,115 INFO L500 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:26:09,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-17 20:26:09,322 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:26:09,323 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:26:09,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:26:09,323 INFO L85 PathProgramCache]: Analyzing trace with hash 74091419, now seen corresponding path program 1 times [2022-03-17 20:26:09,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:26:09,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225237761] [2022-03-17 20:26:09,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:26:09,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:26:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:09,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:26:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:09,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:26:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:09,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:26:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:09,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:26:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:09,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:26:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:09,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:26:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:09,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:26:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:09,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:26:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:09,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-03-17 20:26:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:09,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-03-17 20:26:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:09,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-03-17 20:26:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:09,429 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-03-17 20:26:09,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:26:09,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225237761] [2022-03-17 20:26:09,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225237761] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:26:09,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517088875] [2022-03-17 20:26:09,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:26:09,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:26:09,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 20:26:09,430 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 20:26:09,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-17 20:26:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:09,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-17 20:26:09,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 20:26:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-03-17 20:26:09,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 20:26:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-03-17 20:26:09,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517088875] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 20:26:09,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 20:26:09,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 13 [2022-03-17 20:26:09,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539376621] [2022-03-17 20:26:09,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 20:26:09,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-17 20:26:09,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:26:09,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-17 20:26:09,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-03-17 20:26:09,803 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-03-17 20:26:10,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:26:10,213 INFO L93 Difference]: Finished difference Result 208 states and 234 transitions. [2022-03-17 20:26:10,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-17 20:26:10,214 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2022-03-17 20:26:10,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:26:10,214 INFO L225 Difference]: With dead ends: 208 [2022-03-17 20:26:10,214 INFO L226 Difference]: Without dead ends: 134 [2022-03-17 20:26:10,215 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2022-03-17 20:26:10,215 INFO L912 BasicCegarLoop]: 48 mSDtfsCounter, 123 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 20:26:10,216 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 58 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-17 20:26:10,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-03-17 20:26:10,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2022-03-17 20:26:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 98 states have internal predecessors, (106), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (16), 16 states have call predecessors, (16), 15 states have call successors, (16) [2022-03-17 20:26:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2022-03-17 20:26:10,232 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 88 [2022-03-17 20:26:10,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:26:10,233 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2022-03-17 20:26:10,233 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-03-17 20:26:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2022-03-17 20:26:10,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-03-17 20:26:10,233 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:26:10,234 INFO L500 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:26:10,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-17 20:26:10,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:26:10,451 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:26:10,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:26:10,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1973629885, now seen corresponding path program 2 times [2022-03-17 20:26:10,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:26:10,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000624340] [2022-03-17 20:26:10,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:26:10,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:26:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:10,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:26:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:10,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:26:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:10,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:26:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:10,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:26:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:10,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:26:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:10,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:26:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:10,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:26:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:10,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:26:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:17,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-03-17 20:26:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:17,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-03-17 20:26:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:17,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-03-17 20:26:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:26:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 19 proven. 60 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-17 20:26:17,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:26:17,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000624340] [2022-03-17 20:26:17,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000624340] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:26:17,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716873997] [2022-03-17 20:26:17,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 20:26:17,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:26:17,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 20:26:17,796 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 20:26:17,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-17 20:26:17,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 20:26:17,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 20:26:17,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 101 conjunts are in the unsatisfiable core [2022-03-17 20:26:17,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 20:26:17,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-03-17 20:26:20,157 WARN L855 $PredicateComparison]: unable to prove that (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (not (= mkdup_~j~0 mkdup_~i~0)) (= (store |c_old(#memory_int)| |c_mkdup_#in~a.base| (store (store (select |c_old(#memory_int)| |c_mkdup_#in~a.base|) (+ |c_mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ (* mkdup_~j~0 4) |c_mkdup_#in~a.offset|) mkdup_~x~0)) |c_#memory_int|) (< mkdup_~i~0 |c_mkdup_#in~n|) (<= 0 mkdup_~i~0))) is different from true [2022-03-17 20:26:20,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-03-17 20:26:37,211 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 9 proven. 68 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-17 20:26:37,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 20:26:37,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716873997] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:26:37,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 20:26:37,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 38] total 64 [2022-03-17 20:26:37,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519183196] [2022-03-17 20:26:37,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 20:26:37,604 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-03-17 20:26:37,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:26:37,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-03-17 20:26:37,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=3635, Unknown=6, NotChecked=124, Total=4160 [2022-03-17 20:26:37,605 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand has 64 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 58 states have internal predecessors, (89), 8 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (19), 9 states have call predecessors, (19), 8 states have call successors, (19) [2022-03-17 20:27:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:27:03,397 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2022-03-17 20:27:03,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-17 20:27:03,397 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 58 states have internal predecessors, (89), 8 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (19), 9 states have call predecessors, (19), 8 states have call successors, (19) Word has length 91 [2022-03-17 20:27:03,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:27:03,398 INFO L225 Difference]: With dead ends: 150 [2022-03-17 20:27:03,398 INFO L226 Difference]: Without dead ends: 118 [2022-03-17 20:27:03,399 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4223 ImplicationChecksByTransitivity, 44.8s TimeCoverageRelationStatistics Valid=1170, Invalid=12392, Unknown=14, NotChecked=230, Total=13806 [2022-03-17 20:27:03,399 INFO L912 BasicCegarLoop]: 43 mSDtfsCounter, 167 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-17 20:27:03,400 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 116 Invalid, 2414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1937 Invalid, 0 Unknown, 310 Unchecked, 2.0s Time] [2022-03-17 20:27:03,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-03-17 20:27:03,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2022-03-17 20:27:03,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.1) internal successors, (88), 81 states have internal predecessors, (88), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-03-17 20:27:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2022-03-17 20:27:03,416 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 91 [2022-03-17 20:27:03,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:27:03,416 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2022-03-17 20:27:03,416 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 58 states have internal predecessors, (89), 8 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (19), 9 states have call predecessors, (19), 8 states have call successors, (19) [2022-03-17 20:27:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2022-03-17 20:27:03,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-17 20:27:03,417 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 20:27:03,417 INFO L500 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:27:03,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-17 20:27:03,618 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-03-17 20:27:03,619 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 20:27:03,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 20:27:03,619 INFO L85 PathProgramCache]: Analyzing trace with hash -507134286, now seen corresponding path program 7 times [2022-03-17 20:27:03,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 20:27:03,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337003673] [2022-03-17 20:27:03,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 20:27:03,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 20:27:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:27:03,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 20:27:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:27:03,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:27:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:27:03,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 20:27:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:27:03,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-17 20:27:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:27:03,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-17 20:27:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:27:03,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 20:27:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:27:03,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 20:27:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:27:03,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-17 20:27:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:27:03,715 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 107 proven. 22 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-03-17 20:27:03,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 20:27:03,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337003673] [2022-03-17 20:27:03,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337003673] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 20:27:03,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570098903] [2022-03-17 20:27:03,716 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-17 20:27:03,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:27:03,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 20:27:03,717 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 20:27:03,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-17 20:27:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 20:27:03,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-17 20:27:03,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 20:27:03,943 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 51 proven. 89 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-03-17 20:27:03,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 20:27:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 51 proven. 89 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-03-17 20:27:04,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570098903] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 20:27:04,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 20:27:04,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2022-03-17 20:27:04,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356392838] [2022-03-17 20:27:04,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 20:27:04,089 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-17 20:27:04,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 20:27:04,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-17 20:27:04,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-03-17 20:27:04,090 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-17 20:27:04,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 20:27:04,448 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-03-17 20:27:04,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-17 20:27:04,449 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 88 [2022-03-17 20:27:04,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 20:27:04,449 INFO L225 Difference]: With dead ends: 102 [2022-03-17 20:27:04,449 INFO L226 Difference]: Without dead ends: 0 [2022-03-17 20:27:04,450 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 187 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2022-03-17 20:27:04,450 INFO L912 BasicCegarLoop]: 28 mSDtfsCounter, 41 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 20:27:04,450 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 44 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-17 20:27:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-17 20:27:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-17 20:27:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-17 20:27:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-17 20:27:04,451 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2022-03-17 20:27:04,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 20:27:04,451 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-17 20:27:04,451 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-17 20:27:04,451 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-17 20:27:04,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-17 20:27:04,453 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-17 20:27:04,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-17 20:27:04,661 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 20:27:04,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-17 20:27:11,939 WARN L232 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 56 DAG size of output: 47 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-03-17 20:28:07,763 WARN L232 SmtUtils]: Spent 53.75s on a formula simplification. DAG size of input: 490 DAG size of output: 228 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-03-17 20:28:49,409 WARN L232 SmtUtils]: Spent 41.63s on a formula simplification. DAG size of input: 360 DAG size of output: 184 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-03-17 20:28:49,775 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-17 20:28:49,775 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-03-17 20:28:49,775 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-03-17 20:28:49,775 INFO L878 garLoopResultBuilder]: At program point mkdupENTRY(lines 19 31) the Hoare annotation is: (or (forall ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (or (not (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)) (not (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|)))) (= |#memory_int| |old(#memory_int)|)) [2022-03-17 20:28:49,775 INFO L878 garLoopResultBuilder]: At program point L23-1(line 23) the Hoare annotation is: (or (forall ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (or (not (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)) (not (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|)))) (and (= |mkdup_#in~n| mkdup_~n) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 |mkdup_#in~n|))) [2022-03-17 20:28:49,775 INFO L878 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (or (forall ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (or (not (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)) (not (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|)))) (and (= |mkdup_#in~n| mkdup_~n) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))) [2022-03-17 20:28:49,775 INFO L882 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2022-03-17 20:28:49,775 INFO L878 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (or (forall ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (or (not (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)) (not (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|)))) (and (= |mkdup_#in~n| mkdup_~n) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|))) [2022-03-17 20:28:49,775 INFO L882 garLoopResultBuilder]: For program point mkdupFINAL(lines 19 31) no Hoare annotation was computed. [2022-03-17 20:28:49,775 INFO L882 garLoopResultBuilder]: For program point mkdupEXIT(lines 19 31) no Hoare annotation was computed. [2022-03-17 20:28:49,776 INFO L878 garLoopResultBuilder]: At program point finddupENTRY(lines 33 46) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-03-17 20:28:49,776 INFO L878 garLoopResultBuilder]: At program point L36-3(lines 36 44) the Hoare annotation is: (let ((.cse34 (select |#memory_int| finddup_~a.base)) (.cse29 ((as const (Array Int Int)) 0))) (let ((.cse37 (@diff .cse34 .cse29))) (let ((.cse38 (store .cse34 .cse37 0))) (let ((.cse36 (@diff .cse38 .cse29)) (.cse35 (* finddup_~i~1 4))) (let ((.cse23 (+ finddup_~i~1 2)) (.cse15 (select .cse34 (+ finddup_~a.offset .cse35))) (.cse11 (= |finddup_#in~a.base| finddup_~a.base)) (.cse16 (not (= .cse29 (store .cse38 .cse36 0)))) (.cse28 (+ finddup_~i~1 3))) (let ((.cse18 (not (let ((.cse47 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse47 (+ |finddup_#in~a.offset| 4)) (select .cse47 |finddup_#in~a.offset|))))) (.cse20 (exists ((v_finddup_~j~1_121 Int)) (and (<= finddup_~n (+ v_finddup_~j~1_121 1)) (not (let ((.cse46 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse46 (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select .cse46 (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4)))))) (< v_finddup_~j~1_121 finddup_~n)))) (.cse27 (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (let ((.cse45 (select |#memory_int| finddup_~a.base))) (= (select .cse45 (+ finddup_~a.offset 4)) (select .cse45 (+ finddup_~a.offset (* finddup_~j~1 4)))))) (< finddup_~j~1 finddup_~n)))) (.cse12 (<= finddup_~j~1 .cse28)) (.cse22 (exists ((v_finddup_~j~1_119 Int)) (let ((.cse42 (select |#memory_int| |finddup_#in~a.base|))) (let ((.cse43 (* v_finddup_~j~1_119 4)) (.cse44 (select .cse42 |finddup_#in~a.offset|))) (and (not (= (select .cse42 (+ .cse43 |finddup_#in~a.offset|)) .cse44)) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select .cse42 (+ .cse43 |finddup_#in~a.offset| (- 4))) .cse44)) (< v_finddup_~j~1_119 finddup_~n)))))) (.cse24 (<= finddup_~j~1 (+ finddup_~i~1 1))) (.cse0 (exists ((v_finddup_~j~1_119 Int)) (let ((.cse40 (select |#memory_int| finddup_~a.base))) (let ((.cse39 (select .cse40 finddup_~a.offset)) (.cse41 (* v_finddup_~j~1_119 4))) (and (not (= .cse39 (select .cse40 (+ finddup_~a.offset .cse41 (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= .cse39 (select .cse40 (+ finddup_~a.offset .cse41))))))))) (.cse1 (= finddup_~i~1 1)) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse3 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse4 (= |finddup_#in~n| finddup_~n)) (.cse5 (not (= (select .cse34 finddup_~a.offset) (select .cse34 (+ finddup_~a.offset 4))))) (.cse6 (or (= .cse15 (select .cse34 (+ finddup_~a.offset .cse35 4))) (and .cse11 (not (= (select .cse34 .cse36) (select .cse34 .cse37))) (not (= .cse29 .cse38))) (and .cse11 .cse16))) (.cse26 (<= (+ finddup_~i~1 4) finddup_~n)) (.cse7 (<= 1 finddup_~i~1)) (.cse8 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse9 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse10 (<= .cse23 finddup_~n)) (.cse13 (<= finddup_~n finddup_~j~1)) (.cse14 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse17 (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (or (= .cse15 0) .cse16) .cse17) (and (<= |finddup_#in~n| 1) .cse2) (and (let ((.cse21 (<= finddup_~j~1 .cse23))) (or (and .cse2 .cse3 .cse4 .cse18 (exists ((v_finddup_~j~1_120 Int)) (and (not (let ((.cse19 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse19 (+ |finddup_#in~a.offset| 4)) (select .cse19 (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|))))) (<= 2 v_finddup_~j~1_120) (< v_finddup_~j~1_120 finddup_~n))) .cse20 .cse8 .cse9 .cse10 .cse11 .cse21 .cse13 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse21 .cse13 .cse14))) .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse24 .cse9 (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (let ((.cse25 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse25 (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select .cse25 (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|))))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))) .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse26 .cse7 .cse18 .cse20 .cse8 .cse9 .cse11 .cse27 .cse13 .cse22 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse18 .cse20 .cse8 .cse9 .cse11 .cse27 .cse12 .cse13 .cse22 .cse14 .cse17 (<= .cse28 finddup_~n)) (and .cse2 .cse3 .cse4 (= finddup_~i~1 0) .cse8 .cse9 .cse11 .cse14 .cse17) (let ((.cse32 (select |old(#memory_int)| |finddup_#in~a.base|))) (let ((.cse33 (@diff .cse32 .cse29))) (let ((.cse30 (store .cse32 .cse33 0))) (and (let ((.cse31 (@diff .cse30 .cse29))) (or (not (= .cse29 (store .cse30 .cse31 0))) (not (= (select .cse32 .cse31) (select .cse32 .cse33))))) .cse2 .cse3 .cse4 .cse24 .cse9 (not (= .cse30 .cse29)) .cse13 .cse14 .cse17)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse17)))))))) [2022-03-17 20:28:49,776 INFO L882 garLoopResultBuilder]: For program point L36-4(lines 36 44) no Hoare annotation was computed. [2022-03-17 20:28:49,776 INFO L878 garLoopResultBuilder]: At program point L37-3(lines 37 43) the Hoare annotation is: (let ((.cse6 (select |#memory_int| finddup_~a.base)) (.cse52 ((as const (Array Int Int)) 0))) (let ((.cse34 (@diff .cse6 .cse52)) (.cse31 (* finddup_~i~1 4)) (.cse56 (select |old(#memory_int)| |finddup_#in~a.base|))) (let ((.cse57 (@diff .cse56 .cse52)) (.cse43 (+ finddup_~a.offset .cse31)) (.cse53 (store .cse6 .cse34 0)) (.cse22 (+ finddup_~i~1 2))) (let ((.cse42 (= finddup_~i~1 0)) (.cse3 (= |#memory_int| |old(#memory_int)|)) (.cse14 (or (< finddup_~i~1 finddup_~n) (<= |finddup_#in~n| 0))) (.cse4 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse5 (= |finddup_#in~n| finddup_~n)) (.cse28 (<= .cse22 finddup_~j~1)) (.cse21 (<= 1 finddup_~i~1)) (.cse9 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse33 (@diff .cse53 .cse52)) (.cse26 (* finddup_~j~1 4)) (.cse27 (select .cse6 .cse43)) (.cse54 (store .cse56 .cse57 0)) (.cse41 (+ finddup_~i~1 1))) (let ((.cse11 (<= .cse41 finddup_~j~1)) (.cse24 (<= finddup_~j~1 .cse22)) (.cse20 (let ((.cse55 (@diff .cse54 .cse52))) (or (not (= .cse52 (store .cse54 .cse55 0))) (not (= (select .cse56 .cse55) (select .cse56 .cse57)))))) (.cse7 (<= finddup_~j~1 .cse41)) (.cse23 (not (= .cse54 .cse52))) (.cse25 (<= finddup_~n finddup_~j~1)) (.cse15 (<= 1 finddup_~j~1)) (.cse39 (not (= (select .cse6 (+ finddup_~a.offset .cse26 (- 4))) .cse27))) (.cse35 (not (= .cse52 (store .cse53 .cse33 0)))) (.cse16 (not (let ((.cse51 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse51 (+ |finddup_#in~a.offset| 4)) (select .cse51 |finddup_#in~a.offset|))))) (.cse8 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse29 (exists ((v_finddup_~j~1_121 Int)) (and (not (let ((.cse50 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse50 (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select .cse50 (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|))))) (< v_finddup_~j~1_121 finddup_~n) (<= finddup_~j~1 (+ v_finddup_~j~1_121 1))))) (.cse10 (= |finddup_#in~a.base| finddup_~a.base)) (.cse18 (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (let ((.cse49 (select |#memory_int| finddup_~a.base))) (= (select .cse49 (+ finddup_~a.offset 4)) (select .cse49 (+ finddup_~a.offset (* finddup_~j~1 4)))))) (< finddup_~j~1 finddup_~n)))) (.cse40 (let ((.cse48 (<= (+ finddup_~i~1 3) finddup_~n))) (or (and .cse3 .cse14 .cse4 .cse5 .cse42 .cse28 .cse9 .cse48) (and .cse3 .cse14 .cse4 .cse5 .cse28 .cse21 .cse9 .cse48)))) (.cse19 (exists ((v_finddup_~j~1_119 Int)) (let ((.cse45 (select |#memory_int| |finddup_#in~a.base|))) (let ((.cse46 (* v_finddup_~j~1_119 4)) (.cse47 (select .cse45 |finddup_#in~a.offset|))) (and (not (= (select .cse45 (+ .cse46 |finddup_#in~a.offset|)) .cse47)) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select .cse45 (+ .cse46 |finddup_#in~a.offset| (- 4))) .cse47)) (< v_finddup_~j~1_119 finddup_~n)))))) (.cse12 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse13 (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (and (exists ((v_finddup_~j~1_119 Int)) (let ((.cse1 (select |#memory_int| finddup_~a.base))) (let ((.cse0 (select .cse1 finddup_~a.offset)) (.cse2 (* v_finddup_~j~1_119 4))) (and (not (= .cse0 (select .cse1 (+ finddup_~a.offset .cse2 (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= .cse0 (select .cse1 (+ finddup_~a.offset .cse2)))))))) (= finddup_~i~1 1) .cse3 .cse4 .cse5 (not (= (select .cse6 finddup_~a.offset) (select .cse6 (+ finddup_~a.offset 4)))) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse3 .cse14 .cse4 .cse5 .cse15 .cse16 .cse7 (exists ((v_finddup_~j~1_121 Int)) (and (<= finddup_~n (+ v_finddup_~j~1_121 1)) (not (let ((.cse17 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse17 (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select .cse17 (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4)))))) (< v_finddup_~j~1_121 finddup_~n))) .cse8 .cse9 .cse10 .cse11 .cse18 .cse19 .cse12 .cse13) (and .cse20 .cse3 .cse14 .cse4 .cse5 .cse21 .cse9 (<= .cse22 finddup_~n) .cse23 .cse24 .cse25 .cse12 .cse13) (and (= (select .cse6 (+ finddup_~a.offset .cse26 4)) .cse27) (= .cse27 (select .cse6 (+ finddup_~a.offset .cse26))) .cse3 .cse14 .cse4 .cse5 .cse28 .cse21 .cse16 .cse8 .cse9 .cse29 .cse10 .cse24 .cse19 .cse12 .cse13) (and (<= |finddup_#in~n| 1) .cse3 .cse14) (and .cse3 .cse14 .cse4 .cse5 .cse7 .cse9 (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (let ((.cse30 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse30 (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select .cse30 (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|))))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))) .cse25 .cse12 .cse13) (let ((.cse32 (select .cse6 (+ finddup_~a.offset .cse31 4)))) (and (or (= (select .cse6 (+ finddup_~a.offset .cse31 8)) .cse32) (not (= (select .cse6 .cse33) .cse27)) (not (= .cse27 (select .cse6 .cse34))) .cse35) (= .cse31 0) (exists ((v_finddup_~j~1_119 Int)) (let ((.cse36 (select |#memory_int| finddup_~a.base))) (let ((.cse37 (* v_finddup_~j~1_119 4)) (.cse38 (select .cse36 (+ finddup_~a.offset (* finddup_~i~1 4))))) (and (not (= (select .cse36 (+ finddup_~a.offset .cse37)) .cse38)) (< v_finddup_~j~1_119 finddup_~n) (<= finddup_~j~1 (+ v_finddup_~j~1_119 1)) (not (= (select .cse36 (+ finddup_~a.offset .cse37 (- 4))) .cse38)))))) (not (= .cse27 .cse32)) .cse39 .cse8 .cse10 .cse40 .cse12 .cse13)) (and .cse20 .cse3 .cse14 .cse4 .cse5 .cse7 .cse9 .cse23 .cse25 .cse12 .cse13) (and .cse3 .cse14 .cse4 .cse5 .cse15 .cse8 .cse9 (= finddup_~j~1 .cse41) .cse10 (<= finddup_~j~1 1) .cse12 .cse13) (and .cse3 .cse14 .cse4 .cse5 .cse42 .cse39 (= finddup_~j~1 .cse22) .cse8 .cse9 .cse10 .cse12 .cse13) (and (or (and (not (= .cse27 0)) (let ((.cse44 (* (- 1) finddup_~a.offset))) (or (and (not (= .cse43 .cse34)) (<= (+ 3 (div (+ .cse44 .cse34) 4)) finddup_~j~1)) (and (<= (+ 3 (div (+ .cse33 .cse44) 4)) finddup_~j~1) (not (= .cse43 .cse33)))))) .cse35) .cse16 .cse8 .cse29 .cse10 .cse18 .cse40 .cse19 .cse12 .cse13))))))) [2022-03-17 20:28:49,776 INFO L882 garLoopResultBuilder]: For program point finddupFINAL(lines 33 46) no Hoare annotation was computed. [2022-03-17 20:28:49,776 INFO L882 garLoopResultBuilder]: For program point L36-2(lines 36 44) no Hoare annotation was computed. [2022-03-17 20:28:49,776 INFO L882 garLoopResultBuilder]: For program point L38(lines 38 42) no Hoare annotation was computed. [2022-03-17 20:28:49,776 INFO L882 garLoopResultBuilder]: For program point finddupEXIT(lines 33 46) no Hoare annotation was computed. [2022-03-17 20:28:49,777 INFO L882 garLoopResultBuilder]: For program point L37-2(lines 37 43) no Hoare annotation was computed. [2022-03-17 20:28:49,777 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-17 20:28:49,777 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-17 20:28:49,777 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-03-17 20:28:49,777 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-03-17 20:28:49,777 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 15 17) the Hoare annotation is: true [2022-03-17 20:28:49,777 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-03-17 20:28:49,777 INFO L882 garLoopResultBuilder]: For program point L16-2(lines 15 17) no Hoare annotation was computed. [2022-03-17 20:28:49,777 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2022-03-17 20:28:49,777 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 48 66) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-03-17 20:28:49,777 INFO L878 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-03-17 20:28:49,777 INFO L882 garLoopResultBuilder]: For program point L51-1(line 51) no Hoare annotation was computed. [2022-03-17 20:28:49,777 INFO L878 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (= |main_#t~malloc13.offset| 0) (= |#memory_int| |old(#memory_int)|) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|)) [2022-03-17 20:28:49,777 INFO L882 garLoopResultBuilder]: For program point L52-1(line 52) no Hoare annotation was computed. [2022-03-17 20:28:49,777 INFO L878 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= |main_#t~malloc13.offset| 0) (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc13.base|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (= (select |#valid| main_~a~0.base) 1))) [2022-03-17 20:28:49,777 INFO L882 garLoopResultBuilder]: For program point L54-1(line 54) no Hoare annotation was computed. [2022-03-17 20:28:49,777 INFO L878 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (+ main_~a~0.base 1))) (and (<= .cse0 |#StackHeapBarrier|) (= main_~a~0.offset 0) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#j~2.offset| 0) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~j~0 main_~n~0) (< mkdup_~i~0 main_~n~0) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (< .cse0 |main_~#i~2.base|) (= |main_~#i~2.offset| 0) (< .cse0 |main_~#j~2.base|) (= (select |#valid| main_~a~0.base) 1) (not (= |main_~#i~2.base| |main_~#j~2.base|)))) [2022-03-17 20:28:49,778 INFO L882 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2022-03-17 20:28:49,778 INFO L878 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (let ((.cse5 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (.cse2 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (and (= main_~a~0.offset 0) (let ((.cse0 (<= (+ .cse5 1) main_~n~0)) (.cse1 (<= 1 .cse5)) (.cse3 (= main_~r~0 1)) (.cse4 (= |main_~#i~2.offset| 0))) (or (and .cse0 .cse1 (= 0 .cse2) .cse3 .cse4) (and (<= 1 .cse2) .cse0 (< (+ 1 .cse2) main_~n~0) .cse1 .cse3 .cse4))) (= |main_~#j~2.offset| 0) (let ((.cse6 (select |#memory_int| main_~a~0.base))) (= (select .cse6 (* 4 .cse2)) (select .cse6 (* .cse5 4)))) (not (= .cse5 .cse2)))) [2022-03-17 20:28:49,778 INFO L882 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2022-03-17 20:28:49,778 INFO L882 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2022-03-17 20:28:49,778 INFO L878 garLoopResultBuilder]: At program point L60-2(line 60) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (.cse1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (and (<= (+ .cse0 1) main_~n~0) (< (+ 1 .cse1) main_~n~0) (<= 1 .cse0) (= main_~a~0.offset 0) (= |main_~#j~2.offset| 0) (= |main_~#i~2.offset| 0) (let ((.cse2 (select |#memory_int| main_~a~0.base))) (= (select .cse2 (* 4 .cse1)) (select .cse2 (* .cse0 4)))) (not (= .cse0 .cse1)) |main_#t~short17|)) [2022-03-17 20:28:49,778 INFO L882 garLoopResultBuilder]: For program point L60-3(line 60) no Hoare annotation was computed. [2022-03-17 20:28:49,778 INFO L882 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-03-17 20:28:49,778 INFO L882 garLoopResultBuilder]: For program point L61-3(line 61) no Hoare annotation was computed. [2022-03-17 20:28:49,778 INFO L882 garLoopResultBuilder]: For program point L62-1(line 62) no Hoare annotation was computed. [2022-03-17 20:28:49,778 INFO L882 garLoopResultBuilder]: For program point L63-1(line 63) no Hoare annotation was computed. [2022-03-17 20:28:49,778 INFO L878 garLoopResultBuilder]: At program point L61-2(line 61) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (.cse2 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (and (<= (+ .cse0 1) main_~n~0) (<= 1 .cse0) (= main_~a~0.offset 0) (= |main_~#j~2.offset| 0) (= |main_~#i~2.offset| 0) (let ((.cse1 (select |#memory_int| main_~a~0.base))) (= (select .cse1 (* 4 .cse2)) (select .cse1 (* .cse0 4)))) (not (= .cse0 .cse2)) |main_#t~short20|)) [2022-03-17 20:28:49,778 INFO L878 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (.cse1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (and (= main_~a~0.offset 0) (<= 2 main_~n~0) (not (= |main_#t~mem22| |main_#t~mem21|)) (= |main_~#j~2.offset| 0) (= |main_~#i~2.offset| 0) (let ((.cse0 (select |#memory_int| main_~a~0.base))) (= (select .cse0 (* 4 .cse1)) (select .cse0 (* .cse2 4)))) (not (= .cse2 .cse1)))) [2022-03-17 20:28:49,778 INFO L878 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (<= 2 main_~n~0) (= |main_~#j~2.offset| 0) (= |main_#t~mem26| |main_#t~mem25|) (= |main_~#i~2.offset| 0) (not (= |main_~#i~2.base| |main_~#j~2.base|))) [2022-03-17 20:28:49,778 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 48 66) no Hoare annotation was computed. [2022-03-17 20:28:49,778 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 48 66) no Hoare annotation was computed. [2022-03-17 20:28:49,778 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 11) the Hoare annotation is: true [2022-03-17 20:28:49,778 INFO L882 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-03-17 20:28:49,779 INFO L882 garLoopResultBuilder]: For program point L10-1(line 10) no Hoare annotation was computed. [2022-03-17 20:28:49,779 INFO L882 garLoopResultBuilder]: For program point L10-3(lines 9 11) no Hoare annotation was computed. [2022-03-17 20:28:49,779 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2022-03-17 20:28:49,779 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 11) no Hoare annotation was computed. [2022-03-17 20:28:49,779 INFO L878 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (or (forall ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (or (not (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)) (not (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|)))) (= |#memory_int| |old(#memory_int)|)) [2022-03-17 20:28:49,779 INFO L882 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2022-03-17 20:28:49,779 INFO L882 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-03-17 20:28:49,781 INFO L718 BasicCegarLoop]: Path program histogram: [7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 20:28:49,782 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-17 20:28:49,786 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:259) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:342) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateSelect(Term2Expression.java:355) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:158) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:474) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:193) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-17 20:28:49,789 INFO L158 Benchmark]: Toolchain (without parser) took 570455.23ms. Allocated memory was 211.8MB in the beginning and 306.2MB in the end (delta: 94.4MB). Free memory was 159.6MB in the beginning and 258.4MB in the end (delta: -98.8MB). Peak memory consumption was 163.1MB. Max. memory is 8.0GB. [2022-03-17 20:28:49,789 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 211.8MB. Free memory was 176.2MB in the beginning and 176.0MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-17 20:28:49,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.44ms. Allocated memory is still 211.8MB. Free memory was 159.4MB in the beginning and 187.5MB in the end (delta: -28.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-17 20:28:49,789 INFO L158 Benchmark]: Boogie Preprocessor took 44.04ms. Allocated memory is still 211.8MB. Free memory was 187.5MB in the beginning and 185.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-17 20:28:49,789 INFO L158 Benchmark]: RCFGBuilder took 444.26ms. Allocated memory is still 211.8MB. Free memory was 185.8MB in the beginning and 171.5MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-03-17 20:28:49,789 INFO L158 Benchmark]: IcfgTransformer took 38.19ms. Allocated memory is still 211.8MB. Free memory was 171.5MB in the beginning and 170.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-17 20:28:49,789 INFO L158 Benchmark]: TraceAbstraction took 569665.90ms. Allocated memory was 211.8MB in the beginning and 306.2MB in the end (delta: 94.4MB). Free memory was 169.4MB in the beginning and 258.4MB in the end (delta: -89.0MB). Peak memory consumption was 173.7MB. Max. memory is 8.0GB. [2022-03-17 20:28:49,790 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 211.8MB. Free memory was 176.2MB in the beginning and 176.0MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 255.44ms. Allocated memory is still 211.8MB. Free memory was 159.4MB in the beginning and 187.5MB in the end (delta: -28.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.04ms. Allocated memory is still 211.8MB. Free memory was 187.5MB in the beginning and 185.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 444.26ms. Allocated memory is still 211.8MB. Free memory was 185.8MB in the beginning and 171.5MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 38.19ms. Allocated memory is still 211.8MB. Free memory was 171.5MB in the beginning and 170.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 569665.90ms. Allocated memory was 211.8MB in the beginning and 306.2MB in the end (delta: 94.4MB). Free memory was 169.4MB in the beginning and 258.4MB in the end (delta: -89.0MB). Peak memory consumption was 173.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 569.6s, OverallIterations: 23, TraceHistogramMax: 8, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 271.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 105.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2268 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2154 mSDsluCounter, 3403 SdHoareTripleChecker+Invalid, 8.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2249 IncrementalHoareTripleChecker+Unchecked, 2321 mSDsCounter, 1614 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15815 IncrementalHoareTripleChecker+Invalid, 19678 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1614 mSolverCounterUnsat, 1082 mSDtfsCounter, 15815 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3115 GetRequests, 2180 SyntacticMatches, 50 SemanticMatches, 885 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 16027 ImplicationChecksByTransitivity, 420.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=16, InterpolantAutomatonStates: 518, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 217 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 152 PreInvPairs, 223 NumberOfFragments, 3373 HoareAnnotationTreeSize, 152 FomulaSimplifications, 2276 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 23 FomulaSimplificationsInter, 88832 FormulaSimplificationTreeSizeReductionInter, 104.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 187.5s InterpolantComputationTime, 2726 NumberOfCodeBlocks, 2694 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 3351 ConstructedInterpolants, 171 QuantifiedInterpolants, 37962 SizeOfPredicates, 212 NumberOfNonLiveVariables, 4622 ConjunctsInSsa, 737 ConjunctsInUnsatCore, 50 InterpolantComputations, 9 PerfectInterpolantSequences, 2040/2875 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:259) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-17 20:28:49,995 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-03-17 20:28:50,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...