/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-5d317bd [2022-03-18 22:41:55,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-18 22:41:55,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-18 22:41:55,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-18 22:41:55,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-18 22:41:55,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-18 22:41:55,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-18 22:41:55,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-18 22:41:55,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-18 22:41:55,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-18 22:41:55,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-18 22:41:55,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-18 22:41:55,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-18 22:41:55,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-18 22:41:55,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-18 22:41:55,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-18 22:41:55,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-18 22:41:55,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-18 22:41:55,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-18 22:41:55,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-18 22:41:55,565 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-18 22:41:55,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-18 22:41:55,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-18 22:41:55,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-18 22:41:55,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-18 22:41:55,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-18 22:41:55,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-18 22:41:55,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-18 22:41:55,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-18 22:41:55,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-18 22:41:55,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-18 22:41:55,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-18 22:41:55,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-18 22:41:55,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-18 22:41:55,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-18 22:41:55,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-18 22:41:55,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-18 22:41:55,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-18 22:41:55,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-18 22:41:55,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-18 22:41:55,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-18 22:41:55,584 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-18 22:41:55,585 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-03-18 22:41:55,598 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-18 22:41:55,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-18 22:41:55,598 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-18 22:41:55,598 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-18 22:41:55,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-18 22:41:55,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-18 22:41:55,599 INFO L138 SettingsManager]: * Use SBE=true [2022-03-18 22:41:55,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-18 22:41:55,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-18 22:41:55,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-18 22:41:55,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-18 22:41:55,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-18 22:41:55,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-18 22:41:55,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-18 22:41:55,600 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-18 22:41:55,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-18 22:41:55,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-18 22:41:55,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-18 22:41:55,600 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-18 22:41:55,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 22:41:55,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-18 22:41:55,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-18 22:41:55,601 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-18 22:41:55,601 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-18 22:41:55,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-18 22:41:55,601 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-18 22:41:55,601 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-03-18 22:41:55,601 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-03-18 22:41:55,602 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-18 22:41:55,602 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-18 22:41:55,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-18 22:41:55,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-18 22:41:55,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-18 22:41:55,815 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-18 22:41:55,816 INFO L275 PluginConnector]: CDTParser initialized [2022-03-18 22:41:55,817 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/duplets.c [2022-03-18 22:41:55,876 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a3281862/5a97138a2507433ab40450025ee08f49/FLAG39935556b [2022-03-18 22:41:56,230 INFO L306 CDTParser]: Found 1 translation units. [2022-03-18 22:41:56,230 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c [2022-03-18 22:41:56,237 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a3281862/5a97138a2507433ab40450025ee08f49/FLAG39935556b [2022-03-18 22:41:56,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a3281862/5a97138a2507433ab40450025ee08f49 [2022-03-18 22:41:56,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-18 22:41:56,650 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-18 22:41:56,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-18 22:41:56,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-18 22:41:56,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-18 22:41:56,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 10:41:56" (1/1) ... [2022-03-18 22:41:56,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b232f4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:41:56, skipping insertion in model container [2022-03-18 22:41:56,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 10:41:56" (1/1) ... [2022-03-18 22:41:56,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-18 22:41:56,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-18 22:41:56,789 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-18 22:41:56,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 22:41:56,808 INFO L203 MainTranslator]: Completed pre-run [2022-03-18 22:41:56,815 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-18 22:41:56,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 22:41:56,828 INFO L208 MainTranslator]: Completed translation [2022-03-18 22:41:56,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:41:56 WrapperNode [2022-03-18 22:41:56,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-18 22:41:56,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-18 22:41:56,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-18 22:41:56,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-18 22:41:56,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:41:56" (1/1) ... [2022-03-18 22:41:56,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:41:56" (1/1) ... [2022-03-18 22:41:56,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:41:56" (1/1) ... [2022-03-18 22:41:56,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:41:56" (1/1) ... [2022-03-18 22:41:56,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:41:56" (1/1) ... [2022-03-18 22:41:56,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:41:56" (1/1) ... [2022-03-18 22:41:56,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:41:56" (1/1) ... [2022-03-18 22:41:56,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-18 22:41:56,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-18 22:41:56,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-18 22:41:56,864 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-18 22:41:56,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:41:56" (1/1) ... [2022-03-18 22:41:56,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 22:41:56,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:41:56,891 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-18 22:41:56,901 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-18 22:41:56,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-18 22:41:56,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-18 22:41:56,938 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-18 22:41:56,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-18 22:41:56,938 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-18 22:41:56,938 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2022-03-18 22:41:56,938 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2022-03-18 22:41:56,939 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-18 22:41:56,941 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-03-18 22:41:56,941 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-03-18 22:41:56,941 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-03-18 22:41:56,941 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-18 22:41:56,941 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-18 22:41:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-18 22:41:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-18 22:41:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-18 22:41:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-18 22:41:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-18 22:41:56,943 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2022-03-18 22:41:56,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-18 22:41:56,943 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2022-03-18 22:41:56,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-18 22:41:56,943 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-18 22:41:56,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-18 22:41:56,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-18 22:41:56,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-03-18 22:41:56,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-18 22:41:56,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-18 22:41:56,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-18 22:41:56,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-18 22:41:57,034 INFO L234 CfgBuilder]: Building ICFG [2022-03-18 22:41:57,035 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-18 22:41:57,259 INFO L275 CfgBuilder]: Performing block encoding [2022-03-18 22:41:57,263 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-18 22:41:57,263 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-18 22:41:57,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 10:41:57 BoogieIcfgContainer [2022-03-18 22:41:57,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-18 22:41:57,265 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-18 22:41:57,265 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-18 22:41:57,266 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-18 22:41:57,268 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 10:41:57" (1/1) ... [2022-03-18 22:41:57,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 18.03 10:41:57 BasicIcfg [2022-03-18 22:41:57,281 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-18 22:41:57,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-18 22:41:57,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-18 22:41:57,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-18 22:41:57,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.03 10:41:56" (1/4) ... [2022-03-18 22:41:57,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38bb6268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 10:41:57, skipping insertion in model container [2022-03-18 22:41:57,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:41:56" (2/4) ... [2022-03-18 22:41:57,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38bb6268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 10:41:57, skipping insertion in model container [2022-03-18 22:41:57,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 10:41:57" (3/4) ... [2022-03-18 22:41:57,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38bb6268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.03 10:41:57, skipping insertion in model container [2022-03-18 22:41:57,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 18.03 10:41:57" (4/4) ... [2022-03-18 22:41:57,288 INFO L111 eAbstractionObserver]: Analyzing ICFG duplets.cqvasr [2022-03-18 22:41:57,291 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-18 22:41:57,291 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-18 22:41:57,318 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-18 22:41:57,322 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-18 22:41:57,322 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-18 22:41:57,336 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-18 22:41:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-18 22:41:57,339 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:41:57,340 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-18 22:41:57,340 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:41:57,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:41:57,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1613559281, now seen corresponding path program 1 times [2022-03-18 22:41:57,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:41:57,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340214322] [2022-03-18 22:41:57,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:41:57,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:41:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:57,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:41:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:57,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:41:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:57,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:41:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:57,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:41:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:57,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:41:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:57,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:41:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:57,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:41:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:57,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:41:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:57,561 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-18 22:41:57,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:41:57,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340214322] [2022-03-18 22:41:57,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340214322] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 22:41:57,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 22:41:57,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 22:41:57,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231132459] [2022-03-18 22:41:57,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 22:41:57,566 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 22:41:57,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:41:57,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 22:41:57,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 22:41:57,585 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-18 22:41:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:41:57,685 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2022-03-18 22:41:57,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-18 22:41:57,688 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-18 22:41:57,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:41:57,695 INFO L225 Difference]: With dead ends: 113 [2022-03-18 22:41:57,695 INFO L226 Difference]: Without dead ends: 56 [2022-03-18 22:41:57,698 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-18 22:41:57,701 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-18 22:41:57,702 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-18 22:41:57,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-03-18 22:41:57,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2022-03-18 22:41:57,730 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-18 22:41:57,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-03-18 22:41:57,732 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 49 [2022-03-18 22:41:57,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:41:57,733 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-03-18 22:41:57,733 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-18 22:41:57,733 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-03-18 22:41:57,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-18 22:41:57,734 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:41:57,734 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-18 22:41:57,735 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-18 22:41:57,735 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:41:57,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:41:57,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1068751152, now seen corresponding path program 1 times [2022-03-18 22:41:57,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:41:57,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563488778] [2022-03-18 22:41:57,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:41:57,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:41:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:57,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:41:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:57,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:41:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:57,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:41:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:57,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:41:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:57,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:41:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:57,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:41:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:57,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:41:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:57,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:41:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:57,981 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-18 22:41:57,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:41:57,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563488778] [2022-03-18 22:41:57,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563488778] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:41:57,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008479034] [2022-03-18 22:41:57,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:41:57,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:41:57,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:41:57,985 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-18 22:41:57,990 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-18 22:41:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:58,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-18 22:41:58,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:41:58,321 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-18 22:41:58,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:41:58,556 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-18 22:41:58,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008479034] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 22:41:58,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 22:41:58,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 17 [2022-03-18 22:41:58,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591538901] [2022-03-18 22:41:58,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 22:41:58,558 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-18 22:41:58,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:41:58,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-18 22:41:58,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-03-18 22:41:58,559 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-18 22:41:58,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:41:58,957 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2022-03-18 22:41:58,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-18 22:41:58,957 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-18 22:41:58,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:41:58,959 INFO L225 Difference]: With dead ends: 84 [2022-03-18 22:41:58,959 INFO L226 Difference]: Without dead ends: 63 [2022-03-18 22:41:58,959 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2022-03-18 22:41:58,960 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.2s IncrementalHoareTripleChecker+Time [2022-03-18 22:41:58,961 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.2s Time] [2022-03-18 22:41:58,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-03-18 22:41:58,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2022-03-18 22:41:58,966 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-18 22:41:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-03-18 22:41:58,967 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 49 [2022-03-18 22:41:58,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:41:58,968 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-03-18 22:41:58,968 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-18 22:41:58,968 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-03-18 22:41:58,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-18 22:41:58,969 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:41:58,970 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-18 22:41:58,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-18 22:41:59,186 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-18 22:41:59,186 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:41:59,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:41:59,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1304641222, now seen corresponding path program 1 times [2022-03-18 22:41:59,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:41:59,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049490124] [2022-03-18 22:41:59,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:41:59,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:41:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:59,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:41:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:59,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:41:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:59,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:41:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:59,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:41:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:41:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:59,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:41:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:59,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:41:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:59,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:41:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:59,336 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-18 22:41:59,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:41:59,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049490124] [2022-03-18 22:41:59,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049490124] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 22:41:59,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 22:41:59,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-18 22:41:59,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475974288] [2022-03-18 22:41:59,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 22:41:59,337 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-18 22:41:59,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:41:59,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-18 22:41:59,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-18 22:41:59,338 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-18 22:41:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:41:59,606 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-03-18 22:41:59,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-18 22:41:59,606 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-18 22:41:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:41:59,608 INFO L225 Difference]: With dead ends: 75 [2022-03-18 22:41:59,608 INFO L226 Difference]: Without dead ends: 73 [2022-03-18 22:41:59,608 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-18 22:41:59,609 INFO L912 BasicCegarLoop]: 51 mSDtfsCounter, 81 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-18 22:41:59,609 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-18 22:41:59,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-03-18 22:41:59,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2022-03-18 22:41:59,614 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-18 22:41:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2022-03-18 22:41:59,615 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 50 [2022-03-18 22:41:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:41:59,616 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2022-03-18 22:41:59,616 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-18 22:41:59,616 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-03-18 22:41:59,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-18 22:41:59,616 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:41:59,617 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-18 22:41:59,617 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-18 22:41:59,617 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:41:59,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:41:59,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1610834198, now seen corresponding path program 1 times [2022-03-18 22:41:59,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:41:59,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751801490] [2022-03-18 22:41:59,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:41:59,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:41:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:59,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:41:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:59,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:41:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:59,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:41:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:59,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:41:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:59,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:41:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:59,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:41:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:59,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:41:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:59,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:41:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:59,844 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-18 22:41:59,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:41:59,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751801490] [2022-03-18 22:41:59,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751801490] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:41:59,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46683923] [2022-03-18 22:41:59,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:41:59,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:41:59,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:41:59,846 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-18 22:41:59,847 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-18 22:41:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:41:59,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-18 22:41:59,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:42:00,106 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-18 22:42:00,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:42:00,546 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-18 22:42:00,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46683923] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-18 22:42:00,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-18 22:42:00,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15, 12] total 25 [2022-03-18 22:42:00,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160372246] [2022-03-18 22:42:00,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 22:42:00,550 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-18 22:42:00,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:42:00,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-18 22:42:00,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2022-03-18 22:42:00,552 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-18 22:42:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:42:00,683 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2022-03-18 22:42:00,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-18 22:42:00,683 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-18 22:42:00,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:42:00,686 INFO L225 Difference]: With dead ends: 104 [2022-03-18 22:42:00,686 INFO L226 Difference]: Without dead ends: 70 [2022-03-18 22:42:00,687 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2022-03-18 22:42:00,689 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-18 22:42:00,694 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-18 22:42:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-03-18 22:42:00,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-03-18 22:42:00,703 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-18 22:42:00,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-03-18 22:42:00,704 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 52 [2022-03-18 22:42:00,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:42:00,705 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-03-18 22:42:00,705 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-18 22:42:00,705 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-03-18 22:42:00,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-03-18 22:42:00,705 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:42:00,706 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-18 22:42:00,737 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-18 22:42:00,906 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-18 22:42:00,906 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:42:00,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:42:00,907 INFO L85 PathProgramCache]: Analyzing trace with hash -58927682, now seen corresponding path program 1 times [2022-03-18 22:42:00,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:42:00,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697574196] [2022-03-18 22:42:00,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:42:00,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:42:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:00,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:42:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:00,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:00,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:42:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:00,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:42:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:00,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:42:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:00,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:00,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:42:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:00,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:42:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:00,970 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-18 22:42:00,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:42:00,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697574196] [2022-03-18 22:42:00,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697574196] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:42:00,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005512633] [2022-03-18 22:42:00,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:42:00,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:42:00,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:42:00,972 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-18 22:42:01,007 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-18 22:42:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:01,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-18 22:42:01,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:42:01,104 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-18 22:42:01,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:42:01,204 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-18 22:42:01,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005512633] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 22:42:01,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 22:42:01,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2022-03-18 22:42:01,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566409747] [2022-03-18 22:42:01,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 22:42:01,205 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-18 22:42:01,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:42:01,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-18 22:42:01,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-18 22:42:01,206 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-18 22:42:01,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:42:01,369 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2022-03-18 22:42:01,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-18 22:42:01,369 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-18 22:42:01,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:42:01,370 INFO L225 Difference]: With dead ends: 88 [2022-03-18 22:42:01,370 INFO L226 Difference]: Without dead ends: 67 [2022-03-18 22:42:01,370 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-03-18 22:42:01,371 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-18 22:42:01,371 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-18 22:42:01,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-03-18 22:42:01,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-03-18 22:42:01,376 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-18 22:42:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-03-18 22:42:01,376 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 55 [2022-03-18 22:42:01,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:42:01,376 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-03-18 22:42:01,377 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-18 22:42:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-03-18 22:42:01,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-18 22:42:01,377 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:42:01,377 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-18 22:42:01,395 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-18 22:42:01,587 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-18 22:42:01,587 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:42:01,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:42:01,588 INFO L85 PathProgramCache]: Analyzing trace with hash 925124550, now seen corresponding path program 1 times [2022-03-18 22:42:01,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:42:01,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484172548] [2022-03-18 22:42:01,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:42:01,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:42:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:01,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:42:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:01,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:01,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:42:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:01,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:42:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:01,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:42:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:01,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:01,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:42:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:01,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:42:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:01,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-18 22:42:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:01,899 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-18 22:42:01,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:42:01,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484172548] [2022-03-18 22:42:01,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484172548] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:42:01,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25731268] [2022-03-18 22:42:01,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:42:01,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:42:01,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:42:01,916 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-18 22:42:01,927 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-18 22:42:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:01,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-18 22:42:01,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:42:02,046 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-18 22:42:02,149 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-18 22:42:02,156 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-18 22:42:02,156 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-18 22:42:02,162 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-18 22:42:02,236 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-18 22:42:02,275 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-18 22:42:02,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-18 22:42:02,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25731268] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 22:42:02,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-18 22:42:02,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 25 [2022-03-18 22:42:02,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059121280] [2022-03-18 22:42:02,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 22:42:02,276 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-18 22:42:02,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:42:02,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-18 22:42:02,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2022-03-18 22:42:02,277 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-18 22:42:02,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:42:02,404 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2022-03-18 22:42:02,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-18 22:42:02,404 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-18 22:42:02,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:42:02,405 INFO L225 Difference]: With dead ends: 85 [2022-03-18 22:42:02,405 INFO L226 Difference]: Without dead ends: 83 [2022-03-18 22:42:02,405 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-18 22:42:02,406 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-18 22:42:02,406 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-18 22:42:02,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-03-18 22:42:02,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2022-03-18 22:42:02,411 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-18 22:42:02,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2022-03-18 22:42:02,412 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 57 [2022-03-18 22:42:02,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:42:02,412 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2022-03-18 22:42:02,412 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-18 22:42:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2022-03-18 22:42:02,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-18 22:42:02,413 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:42:02,413 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-18 22:42:02,445 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-18 22:42:02,613 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-18 22:42:02,614 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:42:02,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:42:02,614 INFO L85 PathProgramCache]: Analyzing trace with hash 926048071, now seen corresponding path program 1 times [2022-03-18 22:42:02,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:42:02,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389485918] [2022-03-18 22:42:02,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:42:02,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:42:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:02,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:42:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:02,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:02,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:42:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:02,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:42:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:02,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:42:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:02,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:02,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:42:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:02,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:42:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:02,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-18 22:42:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:02,750 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-18 22:42:02,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:42:02,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389485918] [2022-03-18 22:42:02,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389485918] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 22:42:02,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 22:42:02,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-18 22:42:02,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26844215] [2022-03-18 22:42:02,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 22:42:02,751 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-18 22:42:02,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:42:02,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-18 22:42:02,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-03-18 22:42:02,752 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-18 22:42:03,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:42:03,129 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2022-03-18 22:42:03,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-18 22:42:03,130 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-18 22:42:03,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:42:03,131 INFO L225 Difference]: With dead ends: 106 [2022-03-18 22:42:03,131 INFO L226 Difference]: Without dead ends: 92 [2022-03-18 22:42:03,131 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-03-18 22:42:03,131 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-18 22:42:03,132 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-18 22:42:03,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-03-18 22:42:03,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2022-03-18 22:42:03,138 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-18 22:42:03,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2022-03-18 22:42:03,139 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 57 [2022-03-18 22:42:03,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:42:03,139 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2022-03-18 22:42:03,139 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-18 22:42:03,139 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2022-03-18 22:42:03,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-18 22:42:03,140 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:42:03,140 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-18 22:42:03,140 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-18 22:42:03,141 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:42:03,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:42:03,141 INFO L85 PathProgramCache]: Analyzing trace with hash -984079512, now seen corresponding path program 2 times [2022-03-18 22:42:03,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:42:03,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042633] [2022-03-18 22:42:03,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:42:03,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:42:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:03,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:42:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:03,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:03,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:42:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:03,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:42:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:03,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:42:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:03,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:03,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:42:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:03,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:42:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:03,797 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-18 22:42:03,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:42:03,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042633] [2022-03-18 22:42:03,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042633] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:42:03,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184928235] [2022-03-18 22:42:03,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 22:42:03,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:42:03,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:42:03,812 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-18 22:42:03,852 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-18 22:42:03,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 22:42:03,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 22:42:03,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-18 22:42:03,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:42:04,076 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-03-18 22:42:04,077 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-18 22:42:05,486 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-18 22:42:05,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:42:05,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184928235] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:42:05,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 22:42:05,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 33 [2022-03-18 22:42:05,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413819717] [2022-03-18 22:42:05,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 22:42:05,599 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-18 22:42:05,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:42:05,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-18 22:42:05,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1029, Unknown=1, NotChecked=0, Total=1122 [2022-03-18 22:42:05,600 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-18 22:42:12,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:42:12,625 INFO L93 Difference]: Finished difference Result 129 states and 161 transitions. [2022-03-18 22:42:12,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-18 22:42:12,625 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-18 22:42:12,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:42:12,626 INFO L225 Difference]: With dead ends: 129 [2022-03-18 22:42:12,626 INFO L226 Difference]: Without dead ends: 108 [2022-03-18 22:42:12,627 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=269, Invalid=2810, Unknown=1, NotChecked=0, Total=3080 [2022-03-18 22:42:12,628 INFO L912 BasicCegarLoop]: 51 mSDtfsCounter, 85 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-18 22:42:12,628 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-18 22:42:12,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-03-18 22:42:12,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2022-03-18 22:42:12,635 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-18 22:42:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2022-03-18 22:42:12,641 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 58 [2022-03-18 22:42:12,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:42:12,641 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2022-03-18 22:42:12,641 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-18 22:42:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-03-18 22:42:12,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-18 22:42:12,642 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:42:12,642 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-18 22:42:12,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-18 22:42:12,843 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-18 22:42:12,843 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:42:12,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:42:12,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1828813328, now seen corresponding path program 3 times [2022-03-18 22:42:12,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:42:12,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945694924] [2022-03-18 22:42:12,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:42:12,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:42:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:12,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:42:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:12,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:12,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:42:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:12,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:42:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:12,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:42:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:12,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:12,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:42:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:12,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:42:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:12,913 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-18 22:42:12,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:42:12,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945694924] [2022-03-18 22:42:12,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945694924] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:42:12,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313893703] [2022-03-18 22:42:12,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-18 22:42:12,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:42:12,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:42:12,928 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-18 22:42:12,929 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-18 22:42:12,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-18 22:42:12,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 22:42:12,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-18 22:42:12,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:42:13,076 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-18 22:42:13,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:42:13,186 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-18 22:42:13,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313893703] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 22:42:13,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 22:42:13,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 10 [2022-03-18 22:42:13,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364360174] [2022-03-18 22:42:13,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 22:42:13,187 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-18 22:42:13,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:42:13,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-18 22:42:13,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-03-18 22:42:13,188 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-18 22:42:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:42:13,537 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2022-03-18 22:42:13,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-18 22:42:13,538 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-18 22:42:13,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:42:13,539 INFO L225 Difference]: With dead ends: 145 [2022-03-18 22:42:13,539 INFO L226 Difference]: Without dead ends: 101 [2022-03-18 22:42:13,539 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-18 22:42:13,540 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-18 22:42:13,540 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-18 22:42:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-03-18 22:42:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2022-03-18 22:42:13,547 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-18 22:42:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2022-03-18 22:42:13,548 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 61 [2022-03-18 22:42:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:42:13,548 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2022-03-18 22:42:13,548 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-18 22:42:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2022-03-18 22:42:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-18 22:42:13,549 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:42:13,549 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-18 22:42:13,581 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-18 22:42:13,766 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-18 22:42:13,766 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:42:13,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:42:13,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1290066965, now seen corresponding path program 1 times [2022-03-18 22:42:13,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:42:13,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540314371] [2022-03-18 22:42:13,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:42:13,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:42:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:13,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:42:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:13,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:13,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:42:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:13,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:42:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:13,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:42:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:13,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:13,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:42:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:13,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:42:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:13,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-18 22:42:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:13,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-03-18 22:42:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:13,920 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-18 22:42:13,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:42:13,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540314371] [2022-03-18 22:42:13,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540314371] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 22:42:13,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 22:42:13,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-18 22:42:13,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135439073] [2022-03-18 22:42:13,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 22:42:13,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-18 22:42:13,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:42:13,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-18 22:42:13,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-03-18 22:42:13,921 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-18 22:42:14,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:42:14,215 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2022-03-18 22:42:14,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-18 22:42:14,215 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-18 22:42:14,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:42:14,216 INFO L225 Difference]: With dead ends: 111 [2022-03-18 22:42:14,216 INFO L226 Difference]: Without dead ends: 109 [2022-03-18 22:42:14,216 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-18 22:42:14,217 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.2s IncrementalHoareTripleChecker+Time [2022-03-18 22:42:14,217 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.2s Time] [2022-03-18 22:42:14,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-03-18 22:42:14,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2022-03-18 22:42:14,224 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-18 22:42:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2022-03-18 22:42:14,224 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 64 [2022-03-18 22:42:14,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:42:14,224 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2022-03-18 22:42:14,225 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-18 22:42:14,225 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-03-18 22:42:14,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-18 22:42:14,225 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:42:14,225 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-18 22:42:14,225 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-18 22:42:14,225 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:42:14,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:42:14,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1289143444, now seen corresponding path program 1 times [2022-03-18 22:42:14,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:42:14,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872831458] [2022-03-18 22:42:14,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:42:14,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:42:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:42:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:42:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:42:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:42:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:42:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:42:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-18 22:42:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-03-18 22:42:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,347 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-18 22:42:14,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:42:14,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872831458] [2022-03-18 22:42:14,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872831458] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 22:42:14,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 22:42:14,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-18 22:42:14,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588024665] [2022-03-18 22:42:14,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 22:42:14,347 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-18 22:42:14,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:42:14,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-18 22:42:14,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-18 22:42:14,348 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-18 22:42:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:42:14,601 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2022-03-18 22:42:14,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-18 22:42:14,601 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-18 22:42:14,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:42:14,602 INFO L225 Difference]: With dead ends: 118 [2022-03-18 22:42:14,602 INFO L226 Difference]: Without dead ends: 107 [2022-03-18 22:42:14,602 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-18 22:42:14,603 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-18 22:42:14,603 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-18 22:42:14,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-03-18 22:42:14,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2022-03-18 22:42:14,611 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-18 22:42:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2022-03-18 22:42:14,611 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 64 [2022-03-18 22:42:14,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:42:14,611 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2022-03-18 22:42:14,611 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-18 22:42:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2022-03-18 22:42:14,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-18 22:42:14,612 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:42:14,612 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-18 22:42:14,612 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-18 22:42:14,612 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:42:14,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:42:14,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1636548555, now seen corresponding path program 1 times [2022-03-18 22:42:14,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:42:14,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223572403] [2022-03-18 22:42:14,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:42:14,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:42:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:42:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:42:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:42:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:42:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:42:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:42:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-03-18 22:42:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,682 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-18 22:42:14,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:42:14,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223572403] [2022-03-18 22:42:14,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223572403] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:42:14,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410908501] [2022-03-18 22:42:14,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:42:14,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:42:14,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:42:14,684 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-18 22:42:14,685 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-18 22:42:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:14,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-18 22:42:14,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:42:14,836 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-18 22:42:14,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:42:14,954 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-18 22:42:14,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410908501] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 22:42:14,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 22:42:14,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 9 [2022-03-18 22:42:14,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130011066] [2022-03-18 22:42:14,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 22:42:14,955 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-18 22:42:14,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:42:14,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-18 22:42:14,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-18 22:42:14,956 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-18 22:42:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:42:15,234 INFO L93 Difference]: Finished difference Result 174 states and 211 transitions. [2022-03-18 22:42:15,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-18 22:42:15,234 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-18 22:42:15,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:42:15,235 INFO L225 Difference]: With dead ends: 174 [2022-03-18 22:42:15,235 INFO L226 Difference]: Without dead ends: 112 [2022-03-18 22:42:15,236 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-18 22:42:15,236 INFO L912 BasicCegarLoop]: 46 mSDtfsCounter, 86 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-18 22:42:15,236 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-18 22:42:15,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-03-18 22:42:15,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2022-03-18 22:42:15,242 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-18 22:42:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2022-03-18 22:42:15,243 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 63 [2022-03-18 22:42:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:42:15,243 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2022-03-18 22:42:15,243 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-18 22:42:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2022-03-18 22:42:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-03-18 22:42:15,244 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:42:15,244 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-18 22:42:15,274 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-18 22:42:15,460 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-18 22:42:15,461 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:42:15,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:42:15,461 INFO L85 PathProgramCache]: Analyzing trace with hash 937349773, now seen corresponding path program 2 times [2022-03-18 22:42:15,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:42:15,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532049052] [2022-03-18 22:42:15,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:42:15,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:42:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:15,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:42:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:15,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:15,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:42:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:15,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:42:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:15,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:42:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:15,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:15,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:42:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:15,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:42:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:15,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-03-18 22:42:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:15,624 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-18 22:42:15,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:42:15,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532049052] [2022-03-18 22:42:15,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532049052] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 22:42:15,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 22:42:15,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-18 22:42:15,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317394323] [2022-03-18 22:42:15,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 22:42:15,625 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-18 22:42:15,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:42:15,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-18 22:42:15,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-03-18 22:42:15,626 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-18 22:42:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:42:16,124 INFO L93 Difference]: Finished difference Result 126 states and 148 transitions. [2022-03-18 22:42:16,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-18 22:42:16,124 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-18 22:42:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:42:16,125 INFO L225 Difference]: With dead ends: 126 [2022-03-18 22:42:16,125 INFO L226 Difference]: Without dead ends: 108 [2022-03-18 22:42:16,125 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-18 22:42:16,126 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-18 22:42:16,126 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-18 22:42:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-03-18 22:42:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2022-03-18 22:42:16,132 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-18 22:42:16,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2022-03-18 22:42:16,132 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 66 [2022-03-18 22:42:16,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:42:16,133 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2022-03-18 22:42:16,133 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-18 22:42:16,133 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2022-03-18 22:42:16,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-03-18 22:42:16,133 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:42:16,134 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-18 22:42:16,134 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-18 22:42:16,134 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:42:16,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:42:16,134 INFO L85 PathProgramCache]: Analyzing trace with hash -455253687, now seen corresponding path program 1 times [2022-03-18 22:42:16,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:42:16,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977114759] [2022-03-18 22:42:16,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:42:16,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:42:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:16,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:42:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:16,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:16,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:42:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:16,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:42:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:16,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:42:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:16,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:16,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:42:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:16,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:42:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:16,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-18 22:42:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:16,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-03-18 22:42:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:16,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-03-18 22:42:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:16,349 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-18 22:42:16,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:42:16,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977114759] [2022-03-18 22:42:16,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977114759] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:42:16,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140364627] [2022-03-18 22:42:16,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:42:16,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:42:16,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:42:16,350 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-18 22:42:16,371 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-18 22:42:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:16,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-18 22:42:16,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:42:16,476 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-18 22:42:16,579 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-03-18 22:42:16,580 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-18 22:42:16,606 INFO L356 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-03-18 22:42:16,606 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-18 22:42:16,613 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-18 22:42:16,624 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-18 22:42:16,737 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-18 22:42:16,764 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-18 22:42:16,807 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-18 22:42:17,431 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-18 22:42:17,431 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-18 22:42:17,433 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-18 22:42:17,481 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-18 22:42:17,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:42:17,619 INFO L356 Elim1Store]: treesize reduction 28, result has 33.3 percent of original size [2022-03-18 22:42:17,619 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-18 22:42:17,623 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-18 22:42:17,623 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-18 22:42:17,628 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-18 22:42:17,629 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 67 [2022-03-18 22:42:17,631 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 87 treesize of output 75 [2022-03-18 22:42:17,636 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-18 22:42:17,637 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-18 22:42:17,658 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-18 22:42:17,701 INFO L356 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2022-03-18 22:42:17,701 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-18 22:42:17,719 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-18 22:42:17,720 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-18 22:42:17,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-18 22:42:17,731 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-18 22:42:17,822 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-18 22:42:17,831 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-18 22:42:17,837 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-18 22:42:17,847 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-18 22:42:17,853 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-18 22:42:18,017 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-18 22:42:18,025 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-18 22:42:18,033 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-18 22:42:18,040 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-18 22:42:18,125 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 30 treesize of output 28 [2022-03-18 22:42:18,150 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-03-18 22:42:18,150 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 45 treesize of output 52 [2022-03-18 22:42:18,170 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-18 22:42:18,171 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 40 treesize of output 36 [2022-03-18 22:42:18,232 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-18 22:42:18,232 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 54 treesize of output 55 [2022-03-18 22:42:18,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-18 22:42:18,266 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 54 treesize of output 55 [2022-03-18 22:42:18,506 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-18 22:42:18,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140364627] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-18 22:42:18,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-18 22:42:18,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16, 11] total 27 [2022-03-18 22:42:18,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682893581] [2022-03-18 22:42:18,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 22:42:18,506 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-18 22:42:18,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:42:18,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-18 22:42:18,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=621, Unknown=4, NotChecked=0, Total=702 [2022-03-18 22:42:18,507 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-18 22:42:18,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:42:18,639 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2022-03-18 22:42:18,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-18 22:42:18,640 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-18 22:42:18,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:42:18,640 INFO L225 Difference]: With dead ends: 110 [2022-03-18 22:42:18,640 INFO L226 Difference]: Without dead ends: 108 [2022-03-18 22:42:18,641 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-18 22:42:18,641 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-18 22:42:18,641 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-18 22:42:18,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-03-18 22:42:18,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2022-03-18 22:42:18,647 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-18 22:42:18,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2022-03-18 22:42:18,648 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 70 [2022-03-18 22:42:18,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:42:18,648 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2022-03-18 22:42:18,648 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-18 22:42:18,648 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2022-03-18 22:42:18,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-03-18 22:42:18,649 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:42:18,649 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-18 22:42:18,666 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-18 22:42:18,849 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-18 22:42:18,849 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:42:18,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:42:18,849 INFO L85 PathProgramCache]: Analyzing trace with hash -633726750, now seen corresponding path program 4 times [2022-03-18 22:42:18,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:42:18,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567868178] [2022-03-18 22:42:18,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:42:18,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:42:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:19,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:42:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:19,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:19,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:42:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:19,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:42:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:20,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:42:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:20,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:42:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:20,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:42:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:20,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:42:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:42:22,148 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-18 22:42:22,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:42:22,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567868178] [2022-03-18 22:42:22,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567868178] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:42:22,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40037728] [2022-03-18 22:42:22,149 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-18 22:42:22,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:42:22,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:42:22,150 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-18 22:42:22,151 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-18 22:42:22,228 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-18 22:42:22,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 22:42:22,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-18 22:42:22,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:42:22,248 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-18 22:42:34,026 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-18 22:42:42,665 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-18 22:42:42,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:42:42,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40037728] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:42:42,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 22:42:42,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 46 [2022-03-18 22:42:42,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272477318] [2022-03-18 22:42:42,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 22:42:42,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-18 22:42:42,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:42:42,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-18 22:42:42,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1961, Unknown=9, NotChecked=0, Total=2162 [2022-03-18 22:42:42,833 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-18 22:43:01,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:43:01,552 INFO L93 Difference]: Finished difference Result 167 states and 201 transitions. [2022-03-18 22:43:01,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-18 22:43:01,552 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-18 22:43:01,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:43:01,554 INFO L225 Difference]: With dead ends: 167 [2022-03-18 22:43:01,554 INFO L226 Difference]: Without dead ends: 133 [2022-03-18 22:43:01,555 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1717 ImplicationChecksByTransitivity, 37.9s TimeCoverageRelationStatistics Valid=550, Invalid=5752, Unknown=18, NotChecked=0, Total=6320 [2022-03-18 22:43:01,555 INFO L912 BasicCegarLoop]: 54 mSDtfsCounter, 159 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.4s IncrementalHoareTripleChecker+Time [2022-03-18 22:43:01,556 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.4s Time] [2022-03-18 22:43:01,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-03-18 22:43:01,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 115. [2022-03-18 22:43:01,564 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-18 22:43:01,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 135 transitions. [2022-03-18 22:43:01,565 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 135 transitions. Word has length 67 [2022-03-18 22:43:01,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:43:01,565 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 135 transitions. [2022-03-18 22:43:01,566 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-18 22:43:01,566 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2022-03-18 22:43:01,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-03-18 22:43:01,566 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:43:01,566 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-18 22:43:01,602 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-18 22:43:01,779 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-18 22:43:01,780 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:43:01,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:43:01,780 INFO L85 PathProgramCache]: Analyzing trace with hash -516817935, now seen corresponding path program 1 times [2022-03-18 22:43:01,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:43:01,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192035031] [2022-03-18 22:43:01,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:43:01,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:43:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:01,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:43:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:01,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:43:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:01,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:43:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:01,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:43:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:01,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:43:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:01,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:43:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:01,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:43:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:01,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:43:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:02,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-03-18 22:43:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:02,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-03-18 22:43:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:02,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-03-18 22:43:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:02,081 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-18 22:43:02,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:43:02,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192035031] [2022-03-18 22:43:02,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192035031] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:43:02,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286574562] [2022-03-18 22:43:02,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:43:02,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:43:02,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:43:02,091 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-18 22:43:02,092 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-18 22:43:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:02,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-18 22:43:02,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:43:02,221 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-18 22:43:02,390 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-03-18 22:43:02,391 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-18 22:43:02,729 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-18 22:43:02,729 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-18 22:43:02,803 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-18 22:43:02,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:43:03,008 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-03-18 22:43:03,008 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-18 22:43:03,503 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-18 22:43:03,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286574562] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 22:43:03,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 22:43:03,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 11] total 31 [2022-03-18 22:43:03,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583308262] [2022-03-18 22:43:03,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 22:43:03,504 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-18 22:43:03,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:43:03,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-18 22:43:03,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2022-03-18 22:43:03,505 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-18 22:43:04,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:43:04,824 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2022-03-18 22:43:04,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-18 22:43:04,840 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-18 22:43:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:43:04,841 INFO L225 Difference]: With dead ends: 181 [2022-03-18 22:43:04,841 INFO L226 Difference]: Without dead ends: 179 [2022-03-18 22:43:04,842 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 150 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=430, Invalid=3230, Unknown=0, NotChecked=0, Total=3660 [2022-03-18 22:43:04,842 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.7s IncrementalHoareTripleChecker+Time [2022-03-18 22:43:04,842 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.7s Time] [2022-03-18 22:43:04,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-03-18 22:43:04,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 139. [2022-03-18 22:43:04,870 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-18 22:43:04,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 161 transitions. [2022-03-18 22:43:04,871 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 161 transitions. Word has length 73 [2022-03-18 22:43:04,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:43:04,873 INFO L478 AbstractCegarLoop]: Abstraction has 139 states and 161 transitions. [2022-03-18 22:43:04,873 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-18 22:43:04,873 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 161 transitions. [2022-03-18 22:43:04,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-18 22:43:04,887 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:43:04,888 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-18 22:43:04,914 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-18 22:43:05,105 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-18 22:43:05,105 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:43:05,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:43:05,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2020932442, now seen corresponding path program 1 times [2022-03-18 22:43:05,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:43:05,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640153043] [2022-03-18 22:43:05,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:43:05,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:43:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:05,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:43:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:05,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:43:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:05,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:43:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:05,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:43:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:05,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:43:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:05,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:43:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:05,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:43:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:05,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:43:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:05,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-18 22:43:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:05,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-03-18 22:43:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:05,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-03-18 22:43:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:05,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-03-18 22:43:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:05,495 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-18 22:43:05,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:43:05,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640153043] [2022-03-18 22:43:05,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640153043] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:43:05,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651637778] [2022-03-18 22:43:05,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:43:05,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:43:05,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:43:05,497 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-18 22:43:05,498 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-18 22:43:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:43:05,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 118 conjunts are in the unsatisfiable core [2022-03-18 22:43:05,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:43:05,605 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-18 22:43:05,679 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-18 22:43:07,901 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-18 22:43:07,936 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-18 22:43:12,072 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-18 22:43:14,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 22:43:14,380 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-18 22:43:14,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 22:43:14,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 22:43:14,385 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-18 22:43:14,390 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-18 22:43:14,394 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-18 22:44:40,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 22:44:40,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 22:44:40,039 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-18 22:44:40,039 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 68 treesize of output 54 [2022-03-18 22:44:40,044 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-18 22:44:40,047 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-18 22:44:40,163 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-18 22:44:40,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:44:53,112 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-18 22:44:53,114 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-18 22:45:01,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651637778] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:45:01,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 22:45:01,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 39 [2022-03-18 22:45:01,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429792910] [2022-03-18 22:45:01,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 22:45:01,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-18 22:45:01,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:45:01,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-18 22:45:01,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2162, Unknown=21, NotChecked=94, Total=2450 [2022-03-18 22:45:01,550 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-18 22:46:11,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:46:11,151 INFO L93 Difference]: Finished difference Result 189 states and 216 transitions. [2022-03-18 22:46:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-18 22:46:11,152 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-18 22:46:11,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:46:11,152 INFO L225 Difference]: With dead ends: 189 [2022-03-18 22:46:11,152 INFO L226 Difference]: Without dead ends: 119 [2022-03-18 22:46:11,154 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 99 SyntacticMatches, 10 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1375 ImplicationChecksByTransitivity, 181.9s TimeCoverageRelationStatistics Valid=405, Invalid=5244, Unknown=55, NotChecked=148, Total=5852 [2022-03-18 22:46:11,154 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-18 22:46:11,154 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-18 22:46:11,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-03-18 22:46:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2022-03-18 22:46:11,176 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-18 22:46:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2022-03-18 22:46:11,176 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 76 [2022-03-18 22:46:11,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:46:11,177 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2022-03-18 22:46:11,177 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-18 22:46:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2022-03-18 22:46:11,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-18 22:46:11,177 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:46:11,177 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-18 22:46:11,194 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-18 22:46:11,379 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-18 22:46:11,379 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:46:11,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:46:11,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1723575464, now seen corresponding path program 5 times [2022-03-18 22:46:11,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:46:11,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716284863] [2022-03-18 22:46:11,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:46:11,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:46:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:46:11,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:46:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:46:11,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:46:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:46:11,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:46:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:46:11,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:46:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:46:11,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:46:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:46:11,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:46:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:46:11,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:46:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:46:11,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:46:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:46:11,519 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-18 22:46:11,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:46:11,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716284863] [2022-03-18 22:46:11,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716284863] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:46:11,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037545453] [2022-03-18 22:46:11,520 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-18 22:46:11,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:46:11,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:46:11,521 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-18 22:46:11,522 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-18 22:46:11,595 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-18 22:46:11,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 22:46:11,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-18 22:46:11,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:46:11,708 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-18 22:46:11,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:46:11,838 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-18 22:46:11,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037545453] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 22:46:11,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 22:46:11,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 11 [2022-03-18 22:46:11,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524298605] [2022-03-18 22:46:11,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 22:46:11,839 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-18 22:46:11,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:46:11,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-18 22:46:11,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-03-18 22:46:11,839 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-18 22:46:12,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:46:12,227 INFO L93 Difference]: Finished difference Result 217 states and 256 transitions. [2022-03-18 22:46:12,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-18 22:46:12,228 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-18 22:46:12,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:46:12,229 INFO L225 Difference]: With dead ends: 217 [2022-03-18 22:46:12,229 INFO L226 Difference]: Without dead ends: 141 [2022-03-18 22:46:12,229 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-18 22:46:12,229 INFO L912 BasicCegarLoop]: 47 mSDtfsCounter, 110 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-18 22:46:12,229 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-18 22:46:12,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-03-18 22:46:12,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2022-03-18 22:46:12,239 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-18 22:46:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2022-03-18 22:46:12,240 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 76 [2022-03-18 22:46:12,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:46:12,242 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2022-03-18 22:46:12,242 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-18 22:46:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2022-03-18 22:46:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-03-18 22:46:12,243 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:46:12,243 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-18 22:46:12,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-18 22:46:12,458 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-18 22:46:12,459 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:46:12,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:46:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash 181119312, now seen corresponding path program 6 times [2022-03-18 22:46:12,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:46:12,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086021503] [2022-03-18 22:46:12,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:46:12,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:46:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:46:12,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:46:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:46:12,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:46:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:46:12,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:46:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:46:12,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:46:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:46:12,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:46:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:46:12,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:46:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:46:12,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:46:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:46:12,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:46:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:46:17,878 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-18 22:46:17,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:46:17,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086021503] [2022-03-18 22:46:17,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086021503] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:46:17,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810425285] [2022-03-18 22:46:17,878 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-18 22:46:17,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:46:17,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:46:17,880 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-18 22:46:17,881 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-18 22:46:17,983 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-18 22:46:17,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 22:46:17,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 101 conjunts are in the unsatisfiable core [2022-03-18 22:46:17,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:46:18,052 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-18 22:46:24,488 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-18 22:46:44,541 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-18 22:46:44,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:46:44,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810425285] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:46:44,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 22:46:44,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 38] total 67 [2022-03-18 22:46:44,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747078836] [2022-03-18 22:46:44,939 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 22:46:44,941 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-03-18 22:46:44,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:46:44,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-03-18 22:46:44,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=4237, Unknown=13, NotChecked=0, Total=4556 [2022-03-18 22:46:44,942 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-18 22:48:37,991 WARN L232 SmtUtils]: Spent 5.04s on a formula simplification. DAG size of input: 150 DAG size of output: 104 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 22:49:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:49:41,158 INFO L93 Difference]: Finished difference Result 166 states and 196 transitions. [2022-03-18 22:49:41,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-18 22:49:41,159 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-18 22:49:41,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:49:41,160 INFO L225 Difference]: With dead ends: 166 [2022-03-18 22:49:41,160 INFO L226 Difference]: Without dead ends: 132 [2022-03-18 22:49:41,163 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5198 ImplicationChecksByTransitivity, 202.7s TimeCoverageRelationStatistics Valid=1010, Invalid=16201, Unknown=81, NotChecked=0, Total=17292 [2022-03-18 22:49:41,163 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-18 22:49:41,163 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-18 22:49:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-03-18 22:49:41,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2022-03-18 22:49:41,177 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-18 22:49:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2022-03-18 22:49:41,178 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 149 transitions. Word has length 79 [2022-03-18 22:49:41,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:49:41,178 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 149 transitions. [2022-03-18 22:49:41,178 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-18 22:49:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2022-03-18 22:49:41,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-03-18 22:49:41,179 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:49:41,179 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-18 22:49:41,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-18 22:49:41,400 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-18 22:49:41,400 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:49:41,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:49:41,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1729343584, now seen corresponding path program 1 times [2022-03-18 22:49:41,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:49:41,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816472428] [2022-03-18 22:49:41,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:49:41,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:49:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:41,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:49:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:41,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:49:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:41,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:49:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:41,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:49:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:41,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:49:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:41,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:49:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:41,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:49:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:41,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:49:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:41,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-03-18 22:49:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:41,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-03-18 22:49:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:41,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-03-18 22:49:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:41,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-03-18 22:49:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:41,768 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-18 22:49:41,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:49:41,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816472428] [2022-03-18 22:49:41,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816472428] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:49:41,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996056600] [2022-03-18 22:49:41,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:49:41,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:49:41,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:49:41,770 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-18 22:49:41,791 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-18 22:49:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:41,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 86 conjunts are in the unsatisfiable core [2022-03-18 22:49:41,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:49:41,904 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-18 22:49:42,100 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-18 22:49:42,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 22:49:42,144 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-03-18 22:49:42,144 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-18 22:49:42,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 22:49:42,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 22:49:42,610 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-18 22:49:42,615 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-18 22:49:42,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 22:49:42,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 22:49:42,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2022-03-18 22:49:43,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 22:49:43,750 INFO L356 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-03-18 22:49:43,751 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-18 22:49:43,799 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-18 22:49:43,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:49:44,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996056600] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:49:44,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 22:49:44,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2022-03-18 22:49:44,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012249705] [2022-03-18 22:49:44,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 22:49:44,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-18 22:49:44,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:49:44,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-18 22:49:44,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2022-03-18 22:49:44,055 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-18 22:49:48,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:49:48,461 INFO L93 Difference]: Finished difference Result 182 states and 207 transitions. [2022-03-18 22:49:48,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-18 22:49:48,461 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-18 22:49:48,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:49:48,462 INFO L225 Difference]: With dead ends: 182 [2022-03-18 22:49:48,462 INFO L226 Difference]: Without dead ends: 121 [2022-03-18 22:49:48,463 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 114 SyntacticMatches, 12 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=335, Invalid=3446, Unknown=1, NotChecked=0, Total=3782 [2022-03-18 22:49:48,463 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-18 22:49:48,464 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-18 22:49:48,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-03-18 22:49:48,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2022-03-18 22:49:48,476 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-18 22:49:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2022-03-18 22:49:48,477 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 85 [2022-03-18 22:49:48,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:49:48,477 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2022-03-18 22:49:48,477 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-18 22:49:48,477 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2022-03-18 22:49:48,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-18 22:49:48,478 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:49:48,478 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-18 22:49:48,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-03-18 22:49:48,695 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-18 22:49:48,696 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:49:48,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:49:48,696 INFO L85 PathProgramCache]: Analyzing trace with hash 74091419, now seen corresponding path program 1 times [2022-03-18 22:49:48,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:49:48,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744750449] [2022-03-18 22:49:48,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:49:48,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:49:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:48,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:49:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:48,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:49:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:48,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:49:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:48,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:49:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:48,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:49:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:48,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:49:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:48,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:49:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:48,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:49:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:48,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-03-18 22:49:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:48,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-03-18 22:49:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:48,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-03-18 22:49:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:48,815 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-18 22:49:48,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:49:48,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744750449] [2022-03-18 22:49:48,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744750449] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:49:48,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442047159] [2022-03-18 22:49:48,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:49:48,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:49:48,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:49:48,832 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-18 22:49:48,833 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-18 22:49:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:48,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-18 22:49:48,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:49:49,052 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-18 22:49:49,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:49:49,196 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-18 22:49:49,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442047159] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 22:49:49,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 22:49:49,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 13 [2022-03-18 22:49:49,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347973917] [2022-03-18 22:49:49,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 22:49:49,197 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-18 22:49:49,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:49:49,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-18 22:49:49,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-03-18 22:49:49,198 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-18 22:49:49,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:49:49,615 INFO L93 Difference]: Finished difference Result 208 states and 234 transitions. [2022-03-18 22:49:49,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-18 22:49:49,615 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-18 22:49:49,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:49:49,616 INFO L225 Difference]: With dead ends: 208 [2022-03-18 22:49:49,616 INFO L226 Difference]: Without dead ends: 134 [2022-03-18 22:49:49,616 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-18 22:49:49,617 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-18 22:49:49,620 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-18 22:49:49,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-03-18 22:49:49,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2022-03-18 22:49:49,653 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-18 22:49:49,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2022-03-18 22:49:49,653 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 88 [2022-03-18 22:49:49,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:49:49,654 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2022-03-18 22:49:49,654 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-18 22:49:49,654 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2022-03-18 22:49:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-03-18 22:49:49,654 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:49:49,654 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-18 22:49:49,671 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-18 22:49:49,855 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-18 22:49:49,855 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:49:49,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:49:49,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1973629885, now seen corresponding path program 2 times [2022-03-18 22:49:49,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:49:49,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464526238] [2022-03-18 22:49:49,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:49:49,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:49:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:49,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:49:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:49,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:49:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:49,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:49:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:49,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:49:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:50,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:49:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:50,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:49:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:50,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:49:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:50,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:49:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:57,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-03-18 22:49:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:57,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-03-18 22:49:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:57,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-03-18 22:49:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:49:57,962 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-18 22:49:57,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:49:57,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464526238] [2022-03-18 22:49:57,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464526238] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:49:57,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276619971] [2022-03-18 22:49:57,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 22:49:57,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:49:57,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:49:57,964 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-18 22:49:57,972 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-18 22:49:58,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 22:49:58,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 22:49:58,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 101 conjunts are in the unsatisfiable core [2022-03-18 22:49:58,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:49:58,088 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-18 22:50:09,387 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-18 22:50:11,410 WARN L855 $PredicateComparison]: unable to prove that (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~i~0 c_main_~n~0) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (store (store ((as const (Array Int Int)) 0) (+ c_main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ (* mkdup_~j~0 4) c_main_~a~0.offset) mkdup_~x~0) (select |c_#memory_int| c_main_~a~0.base)))) is different from true [2022-03-18 22:50:26,880 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-18 22:50:26,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:50:27,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276619971] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:50:27,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 22:50:27,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 38] total 64 [2022-03-18 22:50:27,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37615888] [2022-03-18 22:50:27,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 22:50:27,251 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-03-18 22:50:27,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:50:27,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-03-18 22:50:27,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=3630, Unknown=12, NotChecked=124, Total=4160 [2022-03-18 22:50:27,251 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-18 22:50:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:50:57,768 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2022-03-18 22:50:57,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-18 22:50:57,771 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-18 22:50:57,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:50:57,771 INFO L225 Difference]: With dead ends: 150 [2022-03-18 22:50:57,771 INFO L226 Difference]: Without dead ends: 118 [2022-03-18 22:50:57,772 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4286 ImplicationChecksByTransitivity, 58.9s TimeCoverageRelationStatistics Valid=1174, Invalid=12615, Unknown=21, NotChecked=232, Total=14042 [2022-03-18 22:50:57,773 INFO L912 BasicCegarLoop]: 43 mSDtfsCounter, 167 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 2418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 314 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-18 22:50:57,773 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 112 Invalid, 2418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1937 Invalid, 0 Unknown, 314 Unchecked, 2.3s Time] [2022-03-18 22:50:57,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-03-18 22:50:57,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2022-03-18 22:50:57,789 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-18 22:50:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2022-03-18 22:50:57,789 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 91 [2022-03-18 22:50:57,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:50:57,790 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2022-03-18 22:50:57,790 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-18 22:50:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2022-03-18 22:50:57,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-18 22:50:57,790 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:50:57,790 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-18 22:50:57,811 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-18 22:50:58,009 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-18 22:50:58,010 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:50:58,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:50:58,010 INFO L85 PathProgramCache]: Analyzing trace with hash -507134286, now seen corresponding path program 7 times [2022-03-18 22:50:58,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:50:58,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31068044] [2022-03-18 22:50:58,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:50:58,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:50:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:50:58,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:50:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:50:58,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:50:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:50:58,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-18 22:50:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:50:58,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-18 22:50:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:50:58,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-18 22:50:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:50:58,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 22:50:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:50:58,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 22:50:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:50:58,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-18 22:50:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:50:58,111 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-18 22:50:58,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:50:58,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31068044] [2022-03-18 22:50:58,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31068044] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:50:58,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613964028] [2022-03-18 22:50:58,112 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-18 22:50:58,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:50:58,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:50:58,113 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-18 22:50:58,115 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-18 22:50:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:50:58,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-18 22:50:58,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:50:58,319 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-18 22:50:58,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:50:58,448 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-18 22:50:58,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613964028] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 22:50:58,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 22:50:58,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2022-03-18 22:50:58,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126323236] [2022-03-18 22:50:58,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 22:50:58,450 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-18 22:50:58,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:50:58,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-18 22:50:58,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-03-18 22:50:58,451 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-18 22:50:58,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:50:58,931 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-03-18 22:50:58,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-18 22:50:58,931 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-18 22:50:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:50:58,931 INFO L225 Difference]: With dead ends: 102 [2022-03-18 22:50:58,931 INFO L226 Difference]: Without dead ends: 0 [2022-03-18 22:50:58,932 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 187 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2022-03-18 22:50:58,932 INFO L912 BasicCegarLoop]: 28 mSDtfsCounter, 43 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 22:50:58,932 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 42 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-18 22:50:58,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-18 22:50:58,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-18 22:50:58,933 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-18 22:50:58,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-18 22:50:58,933 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2022-03-18 22:50:58,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:50:58,933 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-18 22:50:58,933 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-18 22:50:58,933 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-18 22:50:58,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-18 22:50:58,935 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-18 22:50:58,953 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-18 22:50:59,151 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-18 22:50:59,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-18 22:51:06,513 WARN L232 SmtUtils]: Spent 6.15s 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-18 22:52:35,093 WARN L232 SmtUtils]: Spent 1.44m on a formula simplification. DAG size of input: 497 DAG size of output: 238 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-03-18 22:53:17,630 WARN L232 SmtUtils]: Spent 42.52s on a formula simplification. DAG size of input: 347 DAG size of output: 174 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-03-18 22:53:18,027 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-18 22:53:18,028 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-03-18 22:53:18,028 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-03-18 22:53:18,028 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-18 22:53:18,028 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-18 22:53:18,028 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-18 22:53:18,028 INFO L882 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2022-03-18 22:53:18,028 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-18 22:53:18,028 INFO L882 garLoopResultBuilder]: For program point mkdupFINAL(lines 19 31) no Hoare annotation was computed. [2022-03-18 22:53:18,028 INFO L882 garLoopResultBuilder]: For program point mkdupEXIT(lines 19 31) no Hoare annotation was computed. [2022-03-18 22:53:18,028 INFO L878 garLoopResultBuilder]: At program point finddupENTRY(lines 33 46) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-03-18 22:53:18,028 INFO L878 garLoopResultBuilder]: At program point L36-3(lines 36 44) the Hoare annotation is: (let ((.cse38 (select |#memory_int| finddup_~a.base)) (.cse27 ((as const (Array Int Int)) 0))) (let ((.cse44 (@diff .cse38 .cse27))) (let ((.cse45 (store .cse38 .cse44 0))) (let ((.cse43 (@diff .cse45 .cse27)) (.cse42 (* finddup_~i~1 4))) (let ((.cse26 (+ finddup_~i~1 3)) (.cse14 (select .cse38 (+ finddup_~a.offset .cse42))) (.cse15 (not (= .cse27 (store .cse45 .cse43 0))))) (let ((.cse1 (or (= .cse14 (select .cse38 (+ finddup_~a.offset .cse42 4))) (and (not (= (select .cse38 .cse43) (select .cse38 .cse44))) (not (= .cse27 .cse45))) .cse15)) (.cse2 (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))))))))) (.cse3 (= finddup_~i~1 1)) (.cse6 (not (= (select .cse38 finddup_~a.offset) (select .cse38 (+ finddup_~a.offset 4))))) (.cse10 (<= 3 finddup_~n)) (.cse23 (<= (+ finddup_~i~1 4) finddup_~n)) (.cse18 (not (let ((.cse37 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse37 (+ |finddup_#in~a.offset| 4)) (select .cse37 |finddup_#in~a.offset|))))) (.cse19 (exists ((v_finddup_~j~1_121 Int)) (and (<= finddup_~n (+ v_finddup_~j~1_121 1)) (not (let ((.cse36 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse36 (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select .cse36 (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4)))))) (< v_finddup_~j~1_121 finddup_~n)))) (.cse21 (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (let ((.cse35 (select |#memory_int| finddup_~a.base))) (= (select .cse35 (+ finddup_~a.offset 4)) (select .cse35 (+ finddup_~a.offset (* finddup_~j~1 4)))))) (< finddup_~j~1 finddup_~n)))) (.cse11 (<= finddup_~j~1 .cse26)) (.cse22 (exists ((v_finddup_~j~1_119 Int)) (let ((.cse32 (select |#memory_int| |finddup_#in~a.base|))) (let ((.cse33 (* v_finddup_~j~1_119 4)) (.cse34 (select .cse32 |finddup_#in~a.offset|))) (and (not (= (select .cse32 (+ .cse33 |finddup_#in~a.offset|)) .cse34)) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select .cse32 (+ .cse33 |finddup_#in~a.offset| (- 4))) .cse34)) (< v_finddup_~j~1_119 finddup_~n)))))) (.cse7 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse9 (= |finddup_#in~a.base| finddup_~a.base)) (.cse0 (= |#memory_int| |old(#memory_int)|)) (.cse4 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse5 (= |finddup_#in~n| finddup_~n)) (.cse24 (<= finddup_~j~1 (+ finddup_~i~1 1))) (.cse8 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse12 (<= finddup_~n finddup_~j~1)) (.cse13 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse16 (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (and (<= |finddup_#in~n| 1) .cse0) (and .cse1 .cse2 .cse3 .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (or (= .cse14 0) .cse15) .cse16) (and (let ((.cse20 (+ finddup_~i~1 2))) (let ((.cse17 (<= finddup_~j~1 .cse20))) (or (and .cse1 .cse2 .cse3 .cse0 .cse4 .cse5 .cse10 .cse17 .cse12) (and .cse0 .cse4 .cse5 .cse18 .cse19 (<= .cse20 finddup_~n) .cse17 .cse21 .cse12 .cse22)))) .cse7 .cse8 .cse9 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse0 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse16) (and .cse0 .cse4 .cse5 .cse24 .cse8 (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)))) .cse12 .cse13 .cse16) (and .cse0 .cse4 .cse5 .cse23 (<= 1 finddup_~i~1) .cse18 .cse19 .cse7 .cse8 .cse9 .cse21 .cse12 .cse22 .cse13 .cse16) (and .cse0 .cse4 .cse5 .cse18 .cse19 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse22 .cse13 .cse16 (<= .cse26 finddup_~n)) (and .cse0 .cse4 .cse5 (= finddup_~i~1 0) .cse7 .cse8 .cse9 .cse13 .cse16) (let ((.cse30 (select |old(#memory_int)| |finddup_#in~a.base|))) (let ((.cse31 (@diff .cse30 .cse27))) (let ((.cse28 (store .cse30 .cse31 0))) (and (let ((.cse29 (@diff .cse28 .cse27))) (or (not (= .cse27 (store .cse28 .cse29 0))) (not (= (select .cse30 .cse29) (select .cse30 .cse31))))) .cse0 .cse4 .cse5 .cse24 .cse8 (not (= .cse28 .cse27)) .cse12 .cse13 .cse16))))))))))) [2022-03-18 22:53:18,028 INFO L882 garLoopResultBuilder]: For program point L36-4(lines 36 44) no Hoare annotation was computed. [2022-03-18 22:53:18,029 INFO L878 garLoopResultBuilder]: At program point L37-3(lines 37 43) the Hoare annotation is: (let ((.cse7 (select |#memory_int| finddup_~a.base)) (.cse52 ((as const (Array Int Int)) 0))) (let ((.cse34 (@diff .cse7 .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 .cse7 .cse34 0)) (.cse17 (+ finddup_~i~1 2))) (let ((.cse42 (= finddup_~i~1 0)) (.cse3 (= |#memory_int| |old(#memory_int)|)) (.cse4 (or (< finddup_~i~1 finddup_~n) (<= |finddup_#in~n| 0))) (.cse5 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse6 (= |finddup_#in~n| finddup_~n)) (.cse23 (<= .cse17 finddup_~j~1)) (.cse16 (<= 1 finddup_~i~1)) (.cse10 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse33 (@diff .cse53 .cse52)) (.cse21 (* finddup_~j~1 4)) (.cse22 (select .cse7 .cse43)) (.cse54 (store .cse56 .cse57 0)) (.cse41 (+ finddup_~i~1 1))) (let ((.cse19 (<= finddup_~j~1 .cse17)) (.cse12 (<= .cse41 finddup_~j~1)) (.cse15 (let ((.cse55 (@diff .cse54 .cse52))) (or (not (= .cse52 (store .cse54 .cse55 0))) (not (= (select .cse56 .cse55) (select .cse56 .cse57)))))) (.cse8 (<= finddup_~j~1 .cse41)) (.cse18 (not (= .cse54 .cse52))) (.cse20 (<= finddup_~n finddup_~j~1)) (.cse28 (<= 1 finddup_~j~1)) (.cse39 (not (= (select .cse7 (+ finddup_~a.offset .cse21 (- 4))) .cse22))) (.cse35 (not (= .cse52 (store .cse53 .cse33 0)))) (.cse24 (not (let ((.cse51 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse51 (+ |finddup_#in~a.offset| 4)) (select .cse51 |finddup_#in~a.offset|))))) (.cse9 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse25 (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))))) (.cse11 (= |finddup_#in~a.base| finddup_~a.base)) (.cse40 (let ((.cse49 (<= (+ finddup_~i~1 3) finddup_~n))) (or (and .cse3 .cse4 .cse5 .cse6 .cse42 .cse23 .cse10 .cse49) (and .cse3 .cse4 .cse5 .cse6 .cse23 .cse16 .cse10 .cse49)))) (.cse26 (exists ((v_finddup_~j~1_119 Int)) (let ((.cse46 (select |#memory_int| |finddup_#in~a.base|))) (let ((.cse47 (* v_finddup_~j~1_119 4)) (.cse48 (select .cse46 |finddup_#in~a.offset|))) (and (not (= (select .cse46 (+ .cse47 |finddup_#in~a.offset|)) .cse48)) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select .cse46 (+ .cse47 |finddup_#in~a.offset| (- 4))) .cse48)) (< v_finddup_~j~1_119 finddup_~n)))))) (.cse13 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse14 (= |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 .cse6 (not (= (select .cse7 finddup_~a.offset) (select .cse7 (+ finddup_~a.offset 4)))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse3 .cse4 .cse5 .cse6 .cse16 .cse10 (<= .cse17 finddup_~n) .cse18 .cse19 .cse20 .cse13 .cse14) (and (= (select .cse7 (+ finddup_~a.offset .cse21 4)) .cse22) (= .cse22 (select .cse7 (+ finddup_~a.offset .cse21))) .cse3 .cse4 .cse5 .cse6 .cse23 .cse16 .cse24 .cse9 .cse10 .cse25 .cse11 .cse19 .cse26 .cse13 .cse14) (and (<= |finddup_#in~n| 1) .cse3 .cse4) (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 (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 ((.cse27 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse27 (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select .cse27 (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|))))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))) .cse20 .cse13 .cse14) (and .cse3 .cse4 .cse5 .cse6 .cse28 .cse24 (exists ((v_finddup_~j~1_120 Int)) (and (not (let ((.cse29 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse29 (+ |finddup_#in~a.offset| 4)) (select .cse29 (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|))))) (<= 2 v_finddup_~j~1_120) (< v_finddup_~j~1_120 finddup_~n))) .cse8 (exists ((v_finddup_~j~1_121 Int)) (and (<= finddup_~n (+ v_finddup_~j~1_121 1)) (not (let ((.cse30 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse30 (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select .cse30 (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4)))))) (< v_finddup_~j~1_121 finddup_~n))) .cse9 .cse10 .cse11 .cse12 .cse26 .cse13 .cse14) (let ((.cse32 (select .cse7 (+ finddup_~a.offset .cse31 4)))) (and (or (= (select .cse7 (+ finddup_~a.offset .cse31 8)) .cse32) (not (= (select .cse7 .cse33) .cse22)) (not (= .cse22 (select .cse7 .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 (= .cse22 .cse32)) .cse39 .cse9 .cse11 .cse40 .cse13 .cse14)) (and .cse15 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse18 .cse20 .cse13 .cse14) (and .cse3 .cse4 .cse5 .cse6 .cse28 .cse9 .cse10 (= finddup_~j~1 .cse41) .cse11 (<= finddup_~j~1 1) .cse13 .cse14) (and .cse3 .cse4 .cse5 .cse6 .cse42 .cse39 (= finddup_~j~1 .cse17) .cse9 .cse10 .cse11 .cse13 .cse14) (and (or (and (not (= .cse22 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) .cse24 .cse9 .cse25 .cse11 (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))) .cse40 .cse26 .cse13 .cse14))))))) [2022-03-18 22:53:18,029 INFO L882 garLoopResultBuilder]: For program point finddupFINAL(lines 33 46) no Hoare annotation was computed. [2022-03-18 22:53:18,029 INFO L882 garLoopResultBuilder]: For program point L36-2(lines 36 44) no Hoare annotation was computed. [2022-03-18 22:53:18,029 INFO L882 garLoopResultBuilder]: For program point L38(lines 38 42) no Hoare annotation was computed. [2022-03-18 22:53:18,029 INFO L882 garLoopResultBuilder]: For program point finddupEXIT(lines 33 46) no Hoare annotation was computed. [2022-03-18 22:53:18,029 INFO L882 garLoopResultBuilder]: For program point L37-2(lines 37 43) no Hoare annotation was computed. [2022-03-18 22:53:18,029 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-18 22:53:18,029 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-18 22:53:18,029 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-03-18 22:53:18,029 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-03-18 22:53:18,029 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 15 17) the Hoare annotation is: true [2022-03-18 22:53:18,029 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-03-18 22:53:18,029 INFO L882 garLoopResultBuilder]: For program point L16-2(lines 15 17) no Hoare annotation was computed. [2022-03-18 22:53:18,029 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2022-03-18 22:53:18,029 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 48 66) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-03-18 22:53:18,029 INFO L878 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-03-18 22:53:18,030 INFO L882 garLoopResultBuilder]: For program point L51-1(line 51) no Hoare annotation was computed. [2022-03-18 22:53:18,030 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-18 22:53:18,030 INFO L882 garLoopResultBuilder]: For program point L52-1(line 52) no Hoare annotation was computed. [2022-03-18 22:53:18,030 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-18 22:53:18,030 INFO L882 garLoopResultBuilder]: For program point L54-1(line 54) no Hoare annotation was computed. [2022-03-18 22:53:18,030 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-18 22:53:18,030 INFO L882 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2022-03-18 22:53:18,030 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-18 22:53:18,030 INFO L882 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2022-03-18 22:53:18,030 INFO L882 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2022-03-18 22:53:18,030 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-18 22:53:18,030 INFO L882 garLoopResultBuilder]: For program point L60-3(line 60) no Hoare annotation was computed. [2022-03-18 22:53:18,030 INFO L882 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-03-18 22:53:18,030 INFO L882 garLoopResultBuilder]: For program point L61-3(line 61) no Hoare annotation was computed. [2022-03-18 22:53:18,030 INFO L882 garLoopResultBuilder]: For program point L62-1(line 62) no Hoare annotation was computed. [2022-03-18 22:53:18,030 INFO L882 garLoopResultBuilder]: For program point L63-1(line 63) no Hoare annotation was computed. [2022-03-18 22:53:18,030 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-18 22:53:18,031 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-18 22:53:18,031 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-18 22:53:18,031 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 48 66) no Hoare annotation was computed. [2022-03-18 22:53:18,031 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 48 66) no Hoare annotation was computed. [2022-03-18 22:53:18,031 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 11) the Hoare annotation is: true [2022-03-18 22:53:18,031 INFO L882 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-03-18 22:53:18,031 INFO L882 garLoopResultBuilder]: For program point L10-1(line 10) no Hoare annotation was computed. [2022-03-18 22:53:18,031 INFO L882 garLoopResultBuilder]: For program point L10-3(lines 9 11) no Hoare annotation was computed. [2022-03-18 22:53:18,031 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2022-03-18 22:53:18,031 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 11) no Hoare annotation was computed. [2022-03-18 22:53:18,031 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-18 22:53:18,031 INFO L882 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2022-03-18 22:53:18,031 INFO L882 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-03-18 22:53:18,033 INFO L718 BasicCegarLoop]: Path program histogram: [7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 22:53:18,034 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-18 22:53:18,043 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-18 22:53:18,054 INFO L158 Benchmark]: Toolchain (without parser) took 681404.75ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 122.2MB in the beginning and 166.0MB in the end (delta: -43.8MB). Peak memory consumption was 195.7MB. Max. memory is 8.0GB. [2022-03-18 22:53:18,055 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 174.1MB. Free memory was 138.5MB in the beginning and 138.4MB in the end (delta: 147.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-18 22:53:18,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.45ms. Allocated memory is still 174.1MB. Free memory was 121.9MB in the beginning and 149.9MB in the end (delta: -28.0MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-03-18 22:53:18,055 INFO L158 Benchmark]: Boogie Preprocessor took 33.32ms. Allocated memory is still 174.1MB. Free memory was 149.9MB in the beginning and 147.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-18 22:53:18,055 INFO L158 Benchmark]: RCFGBuilder took 401.40ms. Allocated memory is still 174.1MB. Free memory was 147.8MB in the beginning and 133.8MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-03-18 22:53:18,057 INFO L158 Benchmark]: IcfgTransformer took 16.17ms. Allocated memory is still 174.1MB. Free memory was 133.8MB in the beginning and 132.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-18 22:53:18,059 INFO L158 Benchmark]: TraceAbstraction took 680771.71ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 131.7MB in the beginning and 166.0MB in the end (delta: -34.2MB). Peak memory consumption was 204.9MB. Max. memory is 8.0GB. [2022-03-18 22:53:18,064 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.10ms. Allocated memory is still 174.1MB. Free memory was 138.5MB in the beginning and 138.4MB in the end (delta: 147.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.45ms. Allocated memory is still 174.1MB. Free memory was 121.9MB in the beginning and 149.9MB in the end (delta: -28.0MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.32ms. Allocated memory is still 174.1MB. Free memory was 149.9MB in the beginning and 147.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 401.40ms. Allocated memory is still 174.1MB. Free memory was 147.8MB in the beginning and 133.8MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 16.17ms. Allocated memory is still 174.1MB. Free memory was 133.8MB in the beginning and 132.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 680771.71ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 131.7MB in the beginning and 166.0MB in the end (delta: -34.2MB). Peak memory consumption was 204.9MB. 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: 680.7s, OverallIterations: 23, TraceHistogramMax: 8, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 312.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 138.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2270 SdHoareTripleChecker+Valid, 10.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2156 mSDsluCounter, 3397 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2253 IncrementalHoareTripleChecker+Unchecked, 2315 mSDsCounter, 1614 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15772 IncrementalHoareTripleChecker+Invalid, 19639 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1614 mSolverCounterUnsat, 1082 mSDtfsCounter, 15772 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3116 GetRequests, 2180 SyntacticMatches, 50 SemanticMatches, 886 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 16082 ImplicationChecksByTransitivity, 498.1s 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, 3332 HoareAnnotationTreeSize, 152 FomulaSimplifications, 2276 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 23 FomulaSimplificationsInter, 88022 FormulaSimplificationTreeSizeReductionInter, 137.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 223.3s InterpolantComputationTime, 2726 NumberOfCodeBlocks, 2694 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 3351 ConstructedInterpolants, 171 QuantifiedInterpolants, 37361 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-18 22:53:18,287 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-18 22:53:18,346 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...