/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/loops/eureka_01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 08:03:06,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 08:03:06,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 08:03:06,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 08:03:06,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 08:03:06,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 08:03:06,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 08:03:06,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 08:03:06,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 08:03:06,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 08:03:06,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 08:03:06,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 08:03:06,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 08:03:06,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 08:03:06,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 08:03:06,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 08:03:06,139 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 08:03:06,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 08:03:06,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 08:03:06,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 08:03:06,148 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 08:03:06,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 08:03:06,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 08:03:06,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 08:03:06,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 08:03:06,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 08:03:06,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 08:03:06,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 08:03:06,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 08:03:06,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 08:03:06,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 08:03:06,158 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 08:03:06,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 08:03:06,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 08:03:06,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 08:03:06,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 08:03:06,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 08:03:06,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 08:03:06,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 08:03:06,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 08:03:06,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 08:03:06,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 08:03:06,164 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-03-20 08:03:06,184 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 08:03:06,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 08:03:06,185 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-20 08:03:06,185 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-20 08:03:06,186 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-20 08:03:06,186 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-20 08:03:06,188 INFO L138 SettingsManager]: * Use SBE=true [2022-03-20 08:03:06,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 08:03:06,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 08:03:06,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 08:03:06,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 08:03:06,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 08:03:06,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 08:03:06,189 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 08:03:06,189 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 08:03:06,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 08:03:06,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 08:03:06,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 08:03:06,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 08:03:06,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 08:03:06,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 08:03:06,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-20 08:03:06,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-20 08:03:06,190 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 08:03:06,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-20 08:03:06,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 08:03:06,191 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-03-20 08:03:06,191 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-03-20 08:03:06,192 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 08:03:06,192 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-20 08:03:06,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 08:03:06,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 08:03:06,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 08:03:06,497 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 08:03:06,497 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 08:03:06,498 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_01-1.c [2022-03-20 08:03:06,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb6e286c/7f95d12f96a5402c9f739fc888c8556a/FLAG9b5c019fa [2022-03-20 08:03:06,904 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 08:03:06,905 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-1.c [2022-03-20 08:03:06,914 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb6e286c/7f95d12f96a5402c9f739fc888c8556a/FLAG9b5c019fa [2022-03-20 08:03:07,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb6e286c/7f95d12f96a5402c9f739fc888c8556a [2022-03-20 08:03:07,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 08:03:07,330 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 08:03:07,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 08:03:07,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 08:03:07,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 08:03:07,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 08:03:07" (1/1) ... [2022-03-20 08:03:07,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ee87032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 08:03:07, skipping insertion in model container [2022-03-20 08:03:07,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 08:03:07" (1/1) ... [2022-03-20 08:03:07,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 08:03:07,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 08:03:07,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-1.c[446,459] [2022-03-20 08:03:07,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 08:03:07,549 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 08:03:07,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-1.c[446,459] [2022-03-20 08:03:07,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 08:03:07,578 INFO L208 MainTranslator]: Completed translation [2022-03-20 08:03:07,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 08:03:07 WrapperNode [2022-03-20 08:03:07,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 08:03:07,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 08:03:07,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 08:03:07,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 08:03:07,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 08:03:07" (1/1) ... [2022-03-20 08:03:07,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 08:03:07" (1/1) ... [2022-03-20 08:03:07,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 08:03:07" (1/1) ... [2022-03-20 08:03:07,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 08:03:07" (1/1) ... [2022-03-20 08:03:07,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 08:03:07" (1/1) ... [2022-03-20 08:03:07,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 08:03:07" (1/1) ... [2022-03-20 08:03:07,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 08:03:07" (1/1) ... [2022-03-20 08:03:07,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 08:03:07,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 08:03:07,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 08:03:07,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 08:03:07,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 08:03:07" (1/1) ... [2022-03-20 08:03:07,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 08:03:07,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:03:07,647 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-20 08:03:07,660 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-20 08:03:07,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 08:03:07,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 08:03:07,678 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-20 08:03:07,679 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 08:03:07,679 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 08:03:07,679 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 08:03:07,679 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 08:03:07,679 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-20 08:03:07,679 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 08:03:07,679 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 08:03:07,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 08:03:07,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 08:03:07,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 08:03:07,679 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 08:03:07,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-20 08:03:07,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 08:03:07,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 08:03:07,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 08:03:07,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 08:03:07,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 08:03:07,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 08:03:07,729 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 08:03:07,730 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 08:03:07,979 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 08:03:07,983 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 08:03:07,983 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-03-20 08:03:07,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 08:03:07 BoogieIcfgContainer [2022-03-20 08:03:07,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 08:03:07,985 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 08:03:07,985 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 08:03:07,985 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 08:03:07,987 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 08:03:07" (1/1) ... [2022-03-20 08:03:07,989 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-03-20 08:03:08,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 08:03:08 BasicIcfg [2022-03-20 08:03:08,010 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 08:03:08,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 08:03:08,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 08:03:08,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 08:03:08,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 08:03:07" (1/4) ... [2022-03-20 08:03:08,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3791fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 08:03:08, skipping insertion in model container [2022-03-20 08:03:08,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 08:03:07" (2/4) ... [2022-03-20 08:03:08,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3791fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 08:03:08, skipping insertion in model container [2022-03-20 08:03:08,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 08:03:07" (3/4) ... [2022-03-20 08:03:08,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3791fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 08:03:08, skipping insertion in model container [2022-03-20 08:03:08,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 08:03:08" (4/4) ... [2022-03-20 08:03:08,022 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_01-1.cqvasr [2022-03-20 08:03:08,026 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-20 08:03:08,026 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 08:03:08,060 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 08:03:08,067 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-20 08:03:08,067 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 08:03:08,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 08:03:08,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 08:03:08,096 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:03:08,097 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:03:08,097 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:03:08,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:03:08,104 INFO L85 PathProgramCache]: Analyzing trace with hash -950788698, now seen corresponding path program 1 times [2022-03-20 08:03:08,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:03:08,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571369898] [2022-03-20 08:03:08,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:03:08,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:03:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:08,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:03:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 08:03:08,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:03:08,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571369898] [2022-03-20 08:03:08,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571369898] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 08:03:08,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 08:03:08,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 08:03:08,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840346777] [2022-03-20 08:03:08,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 08:03:08,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 08:03:08,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:03:08,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 08:03:08,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 08:03:08,369 INFO L87 Difference]: Start difference. First operand has 37 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:03:08,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:03:08,397 INFO L93 Difference]: Finished difference Result 63 states and 89 transitions. [2022-03-20 08:03:08,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 08:03:08,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-20 08:03:08,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:03:08,402 INFO L225 Difference]: With dead ends: 63 [2022-03-20 08:03:08,403 INFO L226 Difference]: Without dead ends: 32 [2022-03-20 08:03:08,405 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 08:03:08,407 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 37 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 08:03:08,407 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 47 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 08:03:08,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-20 08:03:08,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-03-20 08:03:08,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 08:03:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-03-20 08:03:08,429 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 19 [2022-03-20 08:03:08,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:03:08,429 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-03-20 08:03:08,430 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:03:08,430 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-03-20 08:03:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 08:03:08,430 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:03:08,430 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:03:08,431 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 08:03:08,431 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:03:08,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:03:08,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1860236376, now seen corresponding path program 1 times [2022-03-20 08:03:08,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:03:08,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021224222] [2022-03-20 08:03:08,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:03:08,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:03:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:08,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:03:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 08:03:08,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:03:08,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021224222] [2022-03-20 08:03:08,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021224222] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 08:03:08,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 08:03:08,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 08:03:08,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977456005] [2022-03-20 08:03:08,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 08:03:08,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 08:03:08,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:03:08,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 08:03:08,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 08:03:08,532 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:03:08,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:03:08,691 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2022-03-20 08:03:08,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 08:03:08,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-20 08:03:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:03:08,694 INFO L225 Difference]: With dead ends: 80 [2022-03-20 08:03:08,694 INFO L226 Difference]: Without dead ends: 48 [2022-03-20 08:03:08,695 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-20 08:03:08,696 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 85 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 08:03:08,696 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 36 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 08:03:08,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-20 08:03:08,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2022-03-20 08:03:08,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 08:03:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-03-20 08:03:08,703 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 19 [2022-03-20 08:03:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:03:08,704 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-03-20 08:03:08,704 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:03:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-03-20 08:03:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-20 08:03:08,705 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:03:08,705 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:03:08,705 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 08:03:08,705 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:03:08,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:03:08,705 INFO L85 PathProgramCache]: Analyzing trace with hash 600491494, now seen corresponding path program 1 times [2022-03-20 08:03:08,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:03:08,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20553987] [2022-03-20 08:03:08,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:03:08,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:03:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:08,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:03:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:08,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:03:08,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:03:08,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20553987] [2022-03-20 08:03:08,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20553987] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 08:03:08,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458768123] [2022-03-20 08:03:08,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:03:08,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:03:08,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:03:08,878 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-20 08:03:08,879 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-20 08:03:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:08,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 08:03:08,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 08:03:09,086 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 11 treesize of output 7 [2022-03-20 08:03:09,186 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 15 treesize of output 7 [2022-03-20 08:03:09,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:03:09,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 08:03:09,308 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 14 treesize of output 12 [2022-03-20 08:03:09,323 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 24 [2022-03-20 08:03:09,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:03:09,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458768123] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 08:03:09,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 08:03:09,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-03-20 08:03:09,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444832633] [2022-03-20 08:03:09,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 08:03:09,357 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-20 08:03:09,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:03:09,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-20 08:03:09,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-03-20 08:03:09,358 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:03:09,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:03:09,755 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2022-03-20 08:03:09,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 08:03:09,756 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-03-20 08:03:09,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:03:09,757 INFO L225 Difference]: With dead ends: 91 [2022-03-20 08:03:09,757 INFO L226 Difference]: Without dead ends: 89 [2022-03-20 08:03:09,758 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2022-03-20 08:03:09,758 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 157 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 08:03:09,759 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 72 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 08:03:09,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-03-20 08:03:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 55. [2022-03-20 08:03:09,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 08:03:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2022-03-20 08:03:09,765 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 25 [2022-03-20 08:03:09,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:03:09,766 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2022-03-20 08:03:09,766 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:03:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2022-03-20 08:03:09,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-20 08:03:09,767 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:03:09,767 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:03:09,787 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-20 08:03:09,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:03:09,987 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:03:09,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:03:09,988 INFO L85 PathProgramCache]: Analyzing trace with hash 89957317, now seen corresponding path program 1 times [2022-03-20 08:03:09,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:03:09,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453524560] [2022-03-20 08:03:09,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:03:09,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:03:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:10,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:03:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:03:10,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:03:10,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453524560] [2022-03-20 08:03:10,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453524560] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 08:03:10,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 08:03:10,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 08:03:10,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363470550] [2022-03-20 08:03:10,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 08:03:10,028 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 08:03:10,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:03:10,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 08:03:10,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 08:03:10,028 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:03:10,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:03:10,087 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-03-20 08:03:10,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 08:03:10,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-03-20 08:03:10,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:03:10,089 INFO L225 Difference]: With dead ends: 82 [2022-03-20 08:03:10,089 INFO L226 Difference]: Without dead ends: 57 [2022-03-20 08:03:10,090 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-20 08:03:10,090 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 08:03:10,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 40 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 08:03:10,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-03-20 08:03:10,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-03-20 08:03:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 49 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 08:03:10,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-03-20 08:03:10,098 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 25 [2022-03-20 08:03:10,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:03:10,098 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-03-20 08:03:10,099 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:03:10,099 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-03-20 08:03:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-20 08:03:10,107 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:03:10,107 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:03:10,107 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 08:03:10,107 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:03:10,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:03:10,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1971894797, now seen corresponding path program 1 times [2022-03-20 08:03:10,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:03:10,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78058393] [2022-03-20 08:03:10,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:03:10,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:03:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:10,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:03:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:10,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:03:10,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:03:10,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78058393] [2022-03-20 08:03:10,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78058393] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 08:03:10,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856778146] [2022-03-20 08:03:10,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:03:10,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:03:10,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:03:10,169 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-20 08:03:10,170 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-20 08:03:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:10,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-20 08:03:10,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 08:03:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:03:10,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 08:03:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:03:10,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856778146] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 08:03:10,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 08:03:10,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-03-20 08:03:10,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177895677] [2022-03-20 08:03:10,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 08:03:10,375 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 08:03:10,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:03:10,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 08:03:10,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-20 08:03:10,375 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:03:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:03:10,603 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2022-03-20 08:03:10,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 08:03:10,603 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-03-20 08:03:10,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:03:10,604 INFO L225 Difference]: With dead ends: 130 [2022-03-20 08:03:10,604 INFO L226 Difference]: Without dead ends: 94 [2022-03-20 08:03:10,605 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-03-20 08:03:10,606 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 111 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 08:03:10,606 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 63 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 08:03:10,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-03-20 08:03:10,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2022-03-20 08:03:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 61 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 08:03:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2022-03-20 08:03:10,614 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 28 [2022-03-20 08:03:10,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:03:10,614 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2022-03-20 08:03:10,614 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:03:10,614 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2022-03-20 08:03:10,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-20 08:03:10,615 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:03:10,615 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:03:10,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-20 08:03:10,815 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:03:10,816 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:03:10,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:03:10,816 INFO L85 PathProgramCache]: Analyzing trace with hash -190528417, now seen corresponding path program 1 times [2022-03-20 08:03:10,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:03:10,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747237596] [2022-03-20 08:03:10,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:03:10,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:03:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:10,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:03:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 08:03:10,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:03:10,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747237596] [2022-03-20 08:03:10,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747237596] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 08:03:10,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449369070] [2022-03-20 08:03:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:03:10,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:03:10,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:03:10,889 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-20 08:03:10,890 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-20 08:03:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:10,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-20 08:03:10,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 08:03:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 08:03:11,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 08:03:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 08:03:11,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449369070] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 08:03:11,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 08:03:11,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-03-20 08:03:11,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027312960] [2022-03-20 08:03:11,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 08:03:11,083 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 08:03:11,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:03:11,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 08:03:11,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-03-20 08:03:11,084 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:03:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:03:11,317 INFO L93 Difference]: Finished difference Result 195 states and 249 transitions. [2022-03-20 08:03:11,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 08:03:11,318 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-03-20 08:03:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:03:11,320 INFO L225 Difference]: With dead ends: 195 [2022-03-20 08:03:11,320 INFO L226 Difference]: Without dead ends: 165 [2022-03-20 08:03:11,320 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-03-20 08:03:11,334 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 150 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 08:03:11,335 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 80 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 08:03:11,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-03-20 08:03:11,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 87. [2022-03-20 08:03:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 80 states have internal predecessors, (103), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 08:03:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2022-03-20 08:03:11,376 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 28 [2022-03-20 08:03:11,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:03:11,376 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2022-03-20 08:03:11,376 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:03:11,376 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2022-03-20 08:03:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-20 08:03:11,379 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:03:11,379 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:03:11,414 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-20 08:03:11,579 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:03:11,580 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:03:11,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:03:11,580 INFO L85 PathProgramCache]: Analyzing trace with hash -85381645, now seen corresponding path program 1 times [2022-03-20 08:03:11,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:03:11,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067606465] [2022-03-20 08:03:11,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:03:11,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:03:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:11,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:03:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:03:11,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:03:11,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067606465] [2022-03-20 08:03:11,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067606465] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 08:03:11,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780523244] [2022-03-20 08:03:11,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:03:11,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:03:11,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:03:11,929 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-20 08:03:11,930 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-20 08:03:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:12,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-20 08:03:12,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 08:03:12,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 79 treesize of output 77 [2022-03-20 08:03:12,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-03-20 08:03:12,216 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-03-20 08:03:12,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-03-20 08:03:12,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-03-20 08:03:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:03:12,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 08:03:14,548 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_9 Int)) (or (forall ((v_ArrVal_192 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|))) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_9)))) is different from false [2022-03-20 08:03:14,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_9)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|)))) is different from false [2022-03-20 08:03:15,700 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int) (v_ArrVal_191 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|) v_ArrVal_191))) (or (<= 0 (select (store .cse0 (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|)) (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_9)) (not (<= 0 v_ArrVal_191))))) is different from false [2022-03-20 08:03:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-03-20 08:03:15,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780523244] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 08:03:15,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 08:03:15,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2022-03-20 08:03:15,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506946813] [2022-03-20 08:03:15,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 08:03:15,744 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-20 08:03:15,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:03:15,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-20 08:03:15,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=556, Unknown=3, NotChecked=150, Total=812 [2022-03-20 08:03:15,745 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:03:16,092 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_9)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|)))) (= c_main_~i~0 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (<= |c_main_~#Dest~0.offset| 0) (<= 0 |c_main_~#Dest~0.offset|) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-20 08:03:16,370 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_9)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|)))) (= |c_main_~#Dest~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0)) is different from false [2022-03-20 08:03:18,390 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|))) (and (forall ((v_main_~x~0_9 Int)) (or (forall ((v_ArrVal_192 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|))) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_9)))) (= .cse0 0) (= |c_main_~#distance~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) .cse0) 1) (= c_main_~j~0 0))) is different from false [2022-03-20 08:03:18,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:03:18,685 INFO L93 Difference]: Finished difference Result 146 states and 186 transitions. [2022-03-20 08:03:18,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-20 08:03:18,685 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-03-20 08:03:18,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:03:18,686 INFO L225 Difference]: With dead ends: 146 [2022-03-20 08:03:18,687 INFO L226 Difference]: Without dead ends: 144 [2022-03-20 08:03:18,687 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=197, Invalid=1153, Unknown=6, NotChecked=450, Total=1806 [2022-03-20 08:03:18,688 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 56 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 418 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 08:03:18,688 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 153 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 339 Invalid, 0 Unknown, 418 Unchecked, 0.1s Time] [2022-03-20 08:03:18,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-03-20 08:03:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 92. [2022-03-20 08:03:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 85 states have internal predecessors, (111), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 08:03:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 118 transitions. [2022-03-20 08:03:18,700 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 118 transitions. Word has length 31 [2022-03-20 08:03:18,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:03:18,701 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 118 transitions. [2022-03-20 08:03:18,701 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:03:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2022-03-20 08:03:18,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-20 08:03:18,705 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:03:18,705 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:03:18,745 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-20 08:03:18,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:03:18,923 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:03:18,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:03:18,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1897789399, now seen corresponding path program 2 times [2022-03-20 08:03:18,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:03:18,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027499397] [2022-03-20 08:03:18,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:03:18,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:03:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:19,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:03:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-20 08:03:19,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:03:19,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027499397] [2022-03-20 08:03:19,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027499397] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 08:03:19,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142813449] [2022-03-20 08:03:19,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 08:03:19,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:03:19,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:03:19,075 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-20 08:03:19,111 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-20 08:03:19,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 08:03:19,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 08:03:19,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-20 08:03:19,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 08:03:19,193 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 15 treesize of output 11 [2022-03-20 08:03:19,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:03:19,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-03-20 08:03:19,310 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 15 treesize of output 7 [2022-03-20 08:03:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-20 08:03:19,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 08:03:21,435 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_56 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_56)) (forall ((v_ArrVal_233 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~i~0_56 4)) v_ArrVal_233) |c_main_~#distance~0.offset|))))) is different from false [2022-03-20 08:03:21,470 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 21 treesize of output 19 [2022-03-20 08:03:21,473 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 154 treesize of output 150 [2022-03-20 08:03:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2022-03-20 08:03:21,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142813449] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 08:03:21,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 08:03:21,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 22 [2022-03-20 08:03:21,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393373097] [2022-03-20 08:03:21,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 08:03:21,542 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-20 08:03:21,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:03:21,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-20 08:03:21,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2022-03-20 08:03:21,543 INFO L87 Difference]: Start difference. First operand 92 states and 118 transitions. Second operand has 22 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:03:23,595 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (= c_main_~i~0 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (forall ((v_main_~i~0_56 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_56)) (forall ((v_ArrVal_233 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~i~0_56 4)) v_ArrVal_233) |c_main_~#distance~0.offset|))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-20 08:03:24,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:03:24,023 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2022-03-20 08:03:24,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-20 08:03:24,024 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-03-20 08:03:24,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:03:24,025 INFO L225 Difference]: With dead ends: 168 [2022-03-20 08:03:24,025 INFO L226 Difference]: Without dead ends: 166 [2022-03-20 08:03:24,025 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=162, Invalid=774, Unknown=2, NotChecked=118, Total=1056 [2022-03-20 08:03:24,026 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 175 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 08:03:24,026 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 80 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 581 Invalid, 0 Unknown, 83 Unchecked, 0.3s Time] [2022-03-20 08:03:24,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-03-20 08:03:24,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 80. [2022-03-20 08:03:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 73 states have internal predecessors, (94), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 08:03:24,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2022-03-20 08:03:24,039 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 31 [2022-03-20 08:03:24,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:03:24,040 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2022-03-20 08:03:24,040 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:03:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2022-03-20 08:03:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-20 08:03:24,041 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:03:24,041 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:03:24,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-20 08:03:24,258 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-20 08:03:24,259 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:03:24,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:03:24,260 INFO L85 PathProgramCache]: Analyzing trace with hash 873363003, now seen corresponding path program 1 times [2022-03-20 08:03:24,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:03:24,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752738488] [2022-03-20 08:03:24,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:03:24,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:03:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:24,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:03:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:24,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 08:03:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:03:24,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:03:24,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752738488] [2022-03-20 08:03:24,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752738488] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 08:03:24,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981189312] [2022-03-20 08:03:24,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:03:24,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:03:24,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:03:24,364 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-20 08:03:24,365 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-20 08:03:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:24,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-20 08:03:24,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 08:03:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:03:24,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 08:03:24,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:03:24,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981189312] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 08:03:24,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 08:03:24,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-03-20 08:03:24,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521879481] [2022-03-20 08:03:24,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 08:03:24,569 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 08:03:24,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:03:24,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 08:03:24,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-03-20 08:03:24,570 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-20 08:03:24,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:03:24,822 INFO L93 Difference]: Finished difference Result 206 states and 262 transitions. [2022-03-20 08:03:24,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 08:03:24,822 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2022-03-20 08:03:24,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:03:24,823 INFO L225 Difference]: With dead ends: 206 [2022-03-20 08:03:24,823 INFO L226 Difference]: Without dead ends: 138 [2022-03-20 08:03:24,823 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-03-20 08:03:24,825 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 197 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 08:03:24,825 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 53 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 08:03:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-03-20 08:03:24,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 96. [2022-03-20 08:03:24,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 89 states have internal predecessors, (111), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 08:03:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2022-03-20 08:03:24,836 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 33 [2022-03-20 08:03:24,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:03:24,836 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2022-03-20 08:03:24,837 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-20 08:03:24,837 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2022-03-20 08:03:24,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-20 08:03:24,837 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:03:24,837 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:03:24,868 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-20 08:03:25,037 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-20 08:03:25,038 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:03:25,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:03:25,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2112270400, now seen corresponding path program 2 times [2022-03-20 08:03:25,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:03:25,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541901427] [2022-03-20 08:03:25,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:03:25,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:03:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:25,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:03:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:25,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:03:25,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:03:25,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541901427] [2022-03-20 08:03:25,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541901427] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 08:03:25,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155256605] [2022-03-20 08:03:25,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 08:03:25,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:03:25,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:03:25,101 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-20 08:03:25,119 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-20 08:03:25,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 08:03:25,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 08:03:25,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-20 08:03:25,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 08:03:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:03:25,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 08:03:25,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:03:25,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155256605] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 08:03:25,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 08:03:25,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-03-20 08:03:25,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505687609] [2022-03-20 08:03:25,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 08:03:25,318 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 08:03:25,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:03:25,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 08:03:25,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-20 08:03:25,318 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:03:25,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:03:25,577 INFO L93 Difference]: Finished difference Result 195 states and 241 transitions. [2022-03-20 08:03:25,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 08:03:25,578 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-03-20 08:03:25,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:03:25,578 INFO L225 Difference]: With dead ends: 195 [2022-03-20 08:03:25,579 INFO L226 Difference]: Without dead ends: 174 [2022-03-20 08:03:25,579 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-03-20 08:03:25,579 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 117 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 08:03:25,580 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 85 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 08:03:25,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-03-20 08:03:25,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 128. [2022-03-20 08:03:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 119 states have (on average 1.2773109243697478) internal successors, (152), 121 states have internal predecessors, (152), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 08:03:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 160 transitions. [2022-03-20 08:03:25,590 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 160 transitions. Word has length 34 [2022-03-20 08:03:25,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:03:25,590 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 160 transitions. [2022-03-20 08:03:25,591 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:03:25,591 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2022-03-20 08:03:25,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-20 08:03:25,598 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:03:25,598 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:03:25,615 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-20 08:03:25,814 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:03:25,815 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:03:25,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:03:25,815 INFO L85 PathProgramCache]: Analyzing trace with hash -848526202, now seen corresponding path program 3 times [2022-03-20 08:03:25,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:03:25,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446342537] [2022-03-20 08:03:25,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:03:25,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:03:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:26,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:03:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:03:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:03:26,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:03:26,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446342537] [2022-03-20 08:03:26,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446342537] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 08:03:26,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453851881] [2022-03-20 08:03:26,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 08:03:26,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:03:26,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:03:26,486 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-20 08:03:26,504 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-20 08:03:26,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-20 08:03:26,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 08:03:26,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-20 08:03:26,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 08:03:26,627 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 54 treesize of output 50 [2022-03-20 08:03:26,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:03:26,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:03:26,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:03:26,701 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 37 treesize of output 42 [2022-03-20 08:03:26,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:03:26,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:03:26,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:03:26,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-20 08:03:26,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:03:26,968 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-03-20 08:03:26,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 63 [2022-03-20 08:03:27,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:03:27,179 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-03-20 08:03:27,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 68 [2022-03-20 08:03:28,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2022-03-20 08:03:28,580 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 08:03:28,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 08:03:44,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= v_main_~j~0_28 0) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353)) |c_main_~#distance~0.offset|)) (not (<= v_main_~j~0_28 1)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_19)))) is different from false [2022-03-20 08:04:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-20 08:04:16,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453851881] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 08:04:16,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 08:04:16,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 48 [2022-03-20 08:04:16,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728518435] [2022-03-20 08:04:16,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 08:04:16,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-20 08:04:16,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:04:16,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-20 08:04:16,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1830, Unknown=13, NotChecked=90, Total=2256 [2022-03-20 08:04:16,882 INFO L87 Difference]: Start difference. First operand 128 states and 160 transitions. Second operand has 48 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 45 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:04:17,580 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 |c_main_~#Dest~0.offset|)) (.cse2 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= .cse0 1) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (= (select .cse1 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= c_main_~i~0 0) (= (select .cse2 (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (<= 1 .cse0) (forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= v_main_~j~0_28 0) (<= 0 (select (let ((.cse3 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351))) (store .cse3 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse3) |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353)) |c_main_~#distance~0.offset|)) (not (<= v_main_~j~0_28 1)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_19)))) (<= |c_main_~#Dest~0.offset| 0) (= 3 (select .cse1 (+ 4 |c_main_~#Dest~0.offset|))) (<= 0 (select .cse2 |c_main_~#distance~0.offset|)) (<= 0 |c_main_~#Dest~0.offset|) (= |c_#NULL.offset| |c_old(#NULL.offset)|)))) is different from false [2022-03-20 08:04:18,135 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 |c_main_~#Dest~0.offset|)) (.cse2 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= .cse0 1) (= |c_main_~#distance~0.offset| 0) (= (select .cse1 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse2 0) 0) (<= 1 .cse0) (forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= v_main_~j~0_28 0) (<= 0 (select (let ((.cse3 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351))) (store .cse3 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse3) |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353)) |c_main_~#distance~0.offset|)) (not (<= v_main_~j~0_28 1)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_19)))) (= 3 (select .cse1 (+ 4 |c_main_~#Dest~0.offset|))) (<= 0 (select .cse2 |c_main_~#distance~0.offset|))))) is different from false [2022-03-20 08:04:18,984 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) (.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|)) (.cse3 (+ 4 |c_main_~#Dest~0.offset|)) (.cse2 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (<= c_main_~j~0 1) (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select .cse0 .cse1) 3) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (= (select .cse0 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse2 0) 0) (not (= (+ (* 4 c_main_~x~0) |c_main_~#distance~0.offset|) 0)) (<= 1 (select .cse0 |c_main_~#Dest~0.offset|)) (= .cse1 .cse3) (exists ((|main_~#Dest~0.base| Int)) (let ((.cse4 (select |c_#memory_int| |main_~#Dest~0.base|))) (and (<= 1 (select .cse4 0)) (= 3 (select .cse4 4)) (= (select .cse4 8) 4) (= c_main_~x~0 (select .cse4 (* c_main_~j~0 4))) (not (= |main_~#Dest~0.base| |c_main_~#distance~0.base|))))) (= 3 (select .cse0 .cse3)) (<= 0 (select .cse2 |c_main_~#distance~0.offset|)) (forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (<= 0 (select (let ((.cse5 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* 4 c_main_~x~0) |c_main_~#distance~0.offset|) v_ArrVal_351))) (store .cse5 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse5) |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353)) |c_main_~#distance~0.offset|)) (<= v_main_~j~0_28 0) (not (<= v_main_~j~0_28 (+ c_main_~j~0 1))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-03-20 08:04:20,995 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_main_~j~0 1) (forall ((v_main_~j~0_28 Int)) (or (<= v_main_~j~0_28 0) (not (<= v_main_~j~0_28 (+ c_main_~j~0 1))) (forall ((v_ArrVal_353 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353) |c_main_~#distance~0.offset|))))) (= |c_main_~#distance~0.offset| 0) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0) (exists ((|main_~#Dest~0.base| Int)) (let ((.cse0 (select |c_#memory_int| |main_~#Dest~0.base|))) (and (<= 1 (select .cse0 0)) (= 3 (select .cse0 4)) (= (select .cse0 8) 4) (or (= (+ (* 4 (select .cse0 (* c_main_~j~0 4))) |c_main_~#distance~0.offset|) |c_main_~#distance~0.offset|) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|))) (not (= |main_~#Dest~0.base| |c_main_~#distance~0.base|))))) (= (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|) (+ 4 |c_main_~#Dest~0.offset|))) is different from false [2022-03-20 08:04:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:04:21,740 INFO L93 Difference]: Finished difference Result 174 states and 213 transitions. [2022-03-20 08:04:21,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-20 08:04:21,740 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 45 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-03-20 08:04:21,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:04:21,741 INFO L225 Difference]: With dead ends: 174 [2022-03-20 08:04:21,741 INFO L226 Difference]: Without dead ends: 142 [2022-03-20 08:04:21,742 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 53.1s TimeCoverageRelationStatistics Valid=592, Invalid=3967, Unknown=17, NotChecked=680, Total=5256 [2022-03-20 08:04:21,743 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 78 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 316 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 08:04:21,743 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 249 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 548 Invalid, 0 Unknown, 316 Unchecked, 0.3s Time] [2022-03-20 08:04:21,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-03-20 08:04:21,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 137. [2022-03-20 08:04:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 128 states have (on average 1.28125) internal successors, (164), 130 states have internal predecessors, (164), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 08:04:21,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 172 transitions. [2022-03-20 08:04:21,755 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 172 transitions. Word has length 37 [2022-03-20 08:04:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:04:21,755 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 172 transitions. [2022-03-20 08:04:21,755 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 45 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:04:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 172 transitions. [2022-03-20 08:04:21,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-20 08:04:21,756 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:04:21,756 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:04:21,775 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-20 08:04:21,956 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,SelfDestructingSolverStorable10 [2022-03-20 08:04:21,957 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:04:21,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:04:21,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1692998073, now seen corresponding path program 1 times [2022-03-20 08:04:21,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:04:21,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577887093] [2022-03-20 08:04:21,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:04:21,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:04:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:04:22,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:04:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:04:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 08:04:22,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:04:22,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577887093] [2022-03-20 08:04:22,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577887093] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 08:04:22,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661692063] [2022-03-20 08:04:22,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:04:22,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:04:22,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:04:22,314 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-20 08:04:22,315 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-20 08:04:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:04:22,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-20 08:04:22,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 08:04:22,407 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 66 treesize of output 62 [2022-03-20 08:04:22,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-03-20 08:04:22,560 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-03-20 08:04:22,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-03-20 08:04:22,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-03-20 08:04:22,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-20 08:04:22,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 08:04:24,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_24 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_24)) (forall ((v_ArrVal_396 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|))))) is different from false [2022-03-20 08:04:25,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_24)))) is different from false [2022-03-20 08:04:25,958 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_396 Int) (v_ArrVal_394 Int) (v_main_~x~0_24 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|) v_ArrVal_394))) (or (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_24)) (<= 0 (select (store .cse0 (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|)) (not (<= 0 v_ArrVal_394))))) is different from false [2022-03-20 08:04:26,001 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 4 not checked. [2022-03-20 08:04:26,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661692063] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 08:04:26,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 08:04:26,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2022-03-20 08:04:26,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897443082] [2022-03-20 08:04:26,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 08:04:26,010 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-20 08:04:26,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:04:26,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-20 08:04:26,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=599, Unknown=3, NotChecked=156, Total=870 [2022-03-20 08:04:26,011 INFO L87 Difference]: Start difference. First operand 137 states and 172 transitions. Second operand has 30 states, 28 states have (on average 2.857142857142857) internal successors, (80), 27 states have internal predecessors, (80), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:04:27,248 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_24)))) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (= |c_main_~#Dest~0.offset| 0) (= c_main_~i~0 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-20 08:04:27,604 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_24)))) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (= |c_main_~#Dest~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0)) is different from false [2022-03-20 08:04:29,627 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|))) (and (= .cse0 0) (= |c_main_~#distance~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) .cse0) 1) (forall ((v_main_~x~0_24 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_24)) (forall ((v_ArrVal_396 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|))))) (= c_main_~j~0 0))) is different from false [2022-03-20 08:04:29,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:04:29,900 INFO L93 Difference]: Finished difference Result 161 states and 198 transitions. [2022-03-20 08:04:29,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-20 08:04:29,900 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.857142857142857) internal successors, (80), 27 states have internal predecessors, (80), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-03-20 08:04:29,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:04:29,901 INFO L225 Difference]: With dead ends: 161 [2022-03-20 08:04:29,901 INFO L226 Difference]: Without dead ends: 142 [2022-03-20 08:04:29,902 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=186, Invalid=1092, Unknown=6, NotChecked=438, Total=1722 [2022-03-20 08:04:29,902 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 48 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 08:04:29,902 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 217 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 377 Invalid, 0 Unknown, 177 Unchecked, 0.2s Time] [2022-03-20 08:04:29,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-03-20 08:04:29,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2022-03-20 08:04:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.28) internal successors, (160), 127 states have internal predecessors, (160), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 08:04:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 168 transitions. [2022-03-20 08:04:29,913 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 168 transitions. Word has length 37 [2022-03-20 08:04:29,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:04:29,914 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 168 transitions. [2022-03-20 08:04:29,914 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.857142857142857) internal successors, (80), 27 states have internal predecessors, (80), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:04:29,914 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 168 transitions. [2022-03-20 08:04:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-20 08:04:29,915 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:04:29,915 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:04:29,936 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-20 08:04:30,136 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:04:30,136 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:04:30,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:04:30,137 INFO L85 PathProgramCache]: Analyzing trace with hash 672670965, now seen corresponding path program 4 times [2022-03-20 08:04:30,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:04:30,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709450296] [2022-03-20 08:04:30,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:04:30,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:04:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:04:30,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:04:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:04:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-20 08:04:30,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:04:30,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709450296] [2022-03-20 08:04:30,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709450296] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 08:04:30,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365175995] [2022-03-20 08:04:30,193 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 08:04:30,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:04:30,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:04:30,194 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-20 08:04:30,231 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-20 08:04:30,263 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 08:04:30,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 08:04:30,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-20 08:04:30,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 08:04:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-20 08:04:30,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 08:04:30,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365175995] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 08:04:30,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 08:04:30,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-03-20 08:04:30,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954613019] [2022-03-20 08:04:30,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 08:04:30,315 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 08:04:30,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:04:30,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 08:04:30,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-20 08:04:30,315 INFO L87 Difference]: Start difference. First operand 134 states and 168 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:04:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:04:30,359 INFO L93 Difference]: Finished difference Result 225 states and 285 transitions. [2022-03-20 08:04:30,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 08:04:30,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-03-20 08:04:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:04:30,360 INFO L225 Difference]: With dead ends: 225 [2022-03-20 08:04:30,360 INFO L226 Difference]: Without dead ends: 134 [2022-03-20 08:04:30,362 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-20 08:04:30,363 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 08:04:30,363 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 75 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 08:04:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-03-20 08:04:30,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-03-20 08:04:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.272) internal successors, (159), 127 states have internal predecessors, (159), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 08:04:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 167 transitions. [2022-03-20 08:04:30,389 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 167 transitions. Word has length 37 [2022-03-20 08:04:30,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:04:30,389 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 167 transitions. [2022-03-20 08:04:30,390 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:04:30,390 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 167 transitions. [2022-03-20 08:04:30,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-20 08:04:30,390 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:04:30,390 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:04:30,411 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-20 08:04:30,609 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,SelfDestructingSolverStorable12 [2022-03-20 08:04:30,610 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:04:30,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:04:30,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1404538378, now seen corresponding path program 1 times [2022-03-20 08:04:30,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:04:30,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580193861] [2022-03-20 08:04:30,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:04:30,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:04:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:04:30,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:04:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:04:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-20 08:04:30,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:04:30,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580193861] [2022-03-20 08:04:30,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580193861] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 08:04:30,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 08:04:30,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 08:04:30,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328555386] [2022-03-20 08:04:30,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 08:04:30,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 08:04:30,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:04:30,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 08:04:30,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 08:04:30,666 INFO L87 Difference]: Start difference. First operand 134 states and 167 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:04:30,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:04:30,774 INFO L93 Difference]: Finished difference Result 208 states and 260 transitions. [2022-03-20 08:04:30,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 08:04:30,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-03-20 08:04:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:04:30,775 INFO L225 Difference]: With dead ends: 208 [2022-03-20 08:04:30,775 INFO L226 Difference]: Without dead ends: 148 [2022-03-20 08:04:30,775 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-20 08:04:30,776 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 61 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 08:04:30,776 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 49 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 08:04:30,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-03-20 08:04:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 134. [2022-03-20 08:04:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.264) internal successors, (158), 127 states have internal predecessors, (158), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 08:04:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2022-03-20 08:04:30,788 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 37 [2022-03-20 08:04:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:04:30,788 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2022-03-20 08:04:30,788 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:04:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2022-03-20 08:04:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-20 08:04:30,788 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:04:30,788 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:04:30,789 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-20 08:04:30,789 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:04:30,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:04:30,789 INFO L85 PathProgramCache]: Analyzing trace with hash 179094910, now seen corresponding path program 1 times [2022-03-20 08:04:30,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:04:30,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667785069] [2022-03-20 08:04:30,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:04:30,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:04:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:04:30,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:04:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:04:30,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 08:04:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:04:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-20 08:04:30,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:04:30,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667785069] [2022-03-20 08:04:30,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667785069] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 08:04:30,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022603308] [2022-03-20 08:04:30,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:04:30,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:04:30,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:04:30,980 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-20 08:04:30,981 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-20 08:04:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:04:31,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-20 08:04:31,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 08:04:31,113 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 13 treesize of output 9 [2022-03-20 08:04:33,242 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 19 treesize of output 7 [2022-03-20 08:04:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-20 08:04:33,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 08:04:35,375 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 16 treesize of output 14 [2022-03-20 08:04:35,377 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 32 treesize of output 28 [2022-03-20 08:04:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-20 08:04:35,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022603308] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 08:04:35,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 08:04:35,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 28 [2022-03-20 08:04:35,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677429366] [2022-03-20 08:04:35,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 08:04:35,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-20 08:04:35,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:04:35,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-20 08:04:35,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=654, Unknown=2, NotChecked=0, Total=756 [2022-03-20 08:04:35,460 INFO L87 Difference]: Start difference. First operand 134 states and 166 transitions. Second operand has 28 states, 26 states have (on average 3.076923076923077) internal successors, (80), 25 states have internal predecessors, (80), 8 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-03-20 08:04:48,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:04:48,459 INFO L93 Difference]: Finished difference Result 306 states and 379 transitions. [2022-03-20 08:04:48,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-20 08:04:48,460 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.076923076923077) internal successors, (80), 25 states have internal predecessors, (80), 8 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 39 [2022-03-20 08:04:48,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:04:48,461 INFO L225 Difference]: With dead ends: 306 [2022-03-20 08:04:48,461 INFO L226 Difference]: Without dead ends: 304 [2022-03-20 08:04:48,462 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=400, Invalid=2562, Unknown=8, NotChecked=0, Total=2970 [2022-03-20 08:04:48,462 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 487 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 425 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-20 08:04:48,463 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [487 Valid, 104 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1038 Invalid, 0 Unknown, 425 Unchecked, 0.5s Time] [2022-03-20 08:04:48,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-03-20 08:04:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 142. [2022-03-20 08:04:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 131 states have (on average 1.251908396946565) internal successors, (164), 133 states have internal predecessors, (164), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-20 08:04:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2022-03-20 08:04:48,491 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 39 [2022-03-20 08:04:48,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:04:48,492 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2022-03-20 08:04:48,492 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.076923076923077) internal successors, (80), 25 states have internal predecessors, (80), 8 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-03-20 08:04:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2022-03-20 08:04:48,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-20 08:04:48,493 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:04:48,493 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:04:48,525 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-20 08:04:48,693 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,SelfDestructingSolverStorable14 [2022-03-20 08:04:48,694 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:04:48,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:04:48,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1199172686, now seen corresponding path program 2 times [2022-03-20 08:04:48,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:04:48,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034524416] [2022-03-20 08:04:48,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:04:48,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:04:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:04:48,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:04:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:04:48,776 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:04:48,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:04:48,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034524416] [2022-03-20 08:04:48,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034524416] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 08:04:48,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067827147] [2022-03-20 08:04:48,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 08:04:48,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:04:48,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:04:48,778 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-20 08:04:48,784 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-20 08:04:48,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 08:04:48,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 08:04:48,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-20 08:04:48,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 08:04:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:04:48,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 08:04:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:04:49,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067827147] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 08:04:49,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 08:04:49,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-03-20 08:04:49,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981632] [2022-03-20 08:04:49,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 08:04:49,025 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-20 08:04:49,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:04:49,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-20 08:04:49,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-03-20 08:04:49,026 INFO L87 Difference]: Start difference. First operand 142 states and 174 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:04:49,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:04:49,385 INFO L93 Difference]: Finished difference Result 312 states and 386 transitions. [2022-03-20 08:04:49,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-20 08:04:49,386 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-03-20 08:04:49,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:04:49,387 INFO L225 Difference]: With dead ends: 312 [2022-03-20 08:04:49,387 INFO L226 Difference]: Without dead ends: 283 [2022-03-20 08:04:49,388 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2022-03-20 08:04:49,389 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 148 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 08:04:49,389 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 83 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 08:04:49,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-03-20 08:04:49,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 181. [2022-03-20 08:04:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 170 states have (on average 1.276470588235294) internal successors, (217), 172 states have internal predecessors, (217), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-20 08:04:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 227 transitions. [2022-03-20 08:04:49,414 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 227 transitions. Word has length 40 [2022-03-20 08:04:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:04:49,414 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 227 transitions. [2022-03-20 08:04:49,415 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:04:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 227 transitions. [2022-03-20 08:04:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-20 08:04:49,415 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:04:49,415 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:04:49,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-20 08:04:49,623 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,SelfDestructingSolverStorable15 [2022-03-20 08:04:49,623 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:04:49,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:04:49,624 INFO L85 PathProgramCache]: Analyzing trace with hash -823687205, now seen corresponding path program 2 times [2022-03-20 08:04:49,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:04:49,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572903827] [2022-03-20 08:04:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:04:49,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:04:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:04:50,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:04:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:04:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 08:04:50,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:04:50,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572903827] [2022-03-20 08:04:50,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572903827] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 08:04:50,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653318700] [2022-03-20 08:04:50,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 08:04:50,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:04:50,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:04:50,077 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-20 08:04:50,078 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-20 08:04:50,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 08:04:50,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 08:04:50,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-20 08:04:50,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 08:04:50,245 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 54 treesize of output 50 [2022-03-20 08:04:50,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-03-20 08:04:50,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:04:50,369 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-03-20 08:04:50,506 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-03-20 08:04:50,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-03-20 08:04:50,627 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-03-20 08:04:50,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-03-20 08:04:50,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-03-20 08:04:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-20 08:04:50,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 08:05:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:05:02,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653318700] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 08:05:02,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 08:05:02,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 16] total 39 [2022-03-20 08:05:02,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007865704] [2022-03-20 08:05:02,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 08:05:02,390 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-20 08:05:02,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:05:02,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-20 08:05:02,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1265, Unknown=8, NotChecked=0, Total=1482 [2022-03-20 08:05:02,391 INFO L87 Difference]: Start difference. First operand 181 states and 227 transitions. Second operand has 39 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 36 states have internal predecessors, (93), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:05:03,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:05:03,515 INFO L93 Difference]: Finished difference Result 408 states and 515 transitions. [2022-03-20 08:05:03,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-20 08:05:03,516 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 36 states have internal predecessors, (93), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-03-20 08:05:03,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:05:03,517 INFO L225 Difference]: With dead ends: 408 [2022-03-20 08:05:03,517 INFO L226 Difference]: Without dead ends: 406 [2022-03-20 08:05:03,518 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=637, Invalid=2777, Unknown=8, NotChecked=0, Total=3422 [2022-03-20 08:05:03,519 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 342 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 584 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-20 08:05:03,519 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 121 Invalid, 1657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 900 Invalid, 0 Unknown, 584 Unchecked, 0.5s Time] [2022-03-20 08:05:03,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-03-20 08:05:03,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 277. [2022-03-20 08:05:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 266 states have (on average 1.3233082706766917) internal successors, (352), 268 states have internal predecessors, (352), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-20 08:05:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 362 transitions. [2022-03-20 08:05:03,547 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 362 transitions. Word has length 40 [2022-03-20 08:05:03,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:05:03,548 INFO L478 AbstractCegarLoop]: Abstraction has 277 states and 362 transitions. [2022-03-20 08:05:03,548 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 36 states have internal predecessors, (93), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:05:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 362 transitions. [2022-03-20 08:05:03,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-20 08:05:03,548 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:05:03,548 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:05:03,569 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-20 08:05:03,762 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-20 08:05:03,762 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:05:03,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:05:03,763 INFO L85 PathProgramCache]: Analyzing trace with hash -945679404, now seen corresponding path program 3 times [2022-03-20 08:05:03,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:05:03,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847892190] [2022-03-20 08:05:03,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:05:03,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:05:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:05:04,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:05:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:05:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-20 08:05:04,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:05:04,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847892190] [2022-03-20 08:05:04,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847892190] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 08:05:04,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567821389] [2022-03-20 08:05:04,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 08:05:04,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:05:04,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:05:04,414 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-20 08:05:04,428 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-20 08:05:04,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-20 08:05:04,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 08:05:04,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-20 08:05:04,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 08:05:04,604 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 18 treesize of output 16 [2022-03-20 08:05:04,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-20 08:05:04,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:05:04,700 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-20 08:05:04,700 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 3 case distinctions, treesize of input 37 treesize of output 42 [2022-03-20 08:05:04,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-20 08:05:04,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:05:04,960 INFO L356 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-03-20 08:05:04,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 59 [2022-03-20 08:05:05,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:05:05,303 INFO L356 Elim1Store]: treesize reduction 238, result has 26.8 percent of original size [2022-03-20 08:05:05,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 4 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 23 case distinctions, treesize of input 88 treesize of output 159 [2022-03-20 08:05:17,789 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-20 08:05:17,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 29 [2022-03-20 08:05:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 08:05:17,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 08:05:19,506 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_ArrVal_639 Int) (v_main_~x~0_39 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* 4 c_main_~x~0) |c_main_~#distance~0.offset|) v_ArrVal_639)) (.cse1 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|))) (or (not (<= 0 (+ v_ArrVal_639 1))) (<= (select .cse0 .cse1) (let ((.cse2 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0)) (.cse3 (* main_~j~0 4))) (+ (select (select .cse2 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse3)) (select .cse0 (+ (* (select (select .cse2 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse3)) 4) |c_main_~#distance~0.offset|))))) (<= 3 main_~j~0) (<= main_~j~0 1) (<= 0 (select (store .cse0 .cse1 v_ArrVal_640) |c_main_~#distance~0.offset|))))) is different from false [2022-03-20 08:05:20,394 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_639)) (.cse1 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|))) (or (<= (select .cse0 .cse1) (let ((.cse2 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0)) (.cse3 (* v_main_~j~0_53 4))) (+ (select .cse0 (+ (* (select (select .cse2 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse3)) 4) |c_main_~#distance~0.offset|)) (select (select .cse2 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse3))))) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= 0 (select (store .cse0 .cse1 v_ArrVal_640) |c_main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))) is different from false [2022-03-20 08:05:21,407 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse1 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|)) (.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 4)) v_ArrVal_639))) (or (<= 0 (select (store .cse0 .cse1 v_ArrVal_640) |c_main_~#distance~0.offset|)) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= (select .cse0 .cse1) (let ((.cse2 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0)) (.cse3 (* v_main_~j~0_53 4))) (+ (select (select .cse2 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse3)) (select .cse0 (+ (* (select (select .cse2 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse3)) 4) |c_main_~#distance~0.offset|))))) (<= 3 v_main_~j~0_53)))) is different from false [2022-03-20 08:05:25,032 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2022-03-20 08:05:25,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567821389] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 08:05:25,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 08:05:25,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 21] total 55 [2022-03-20 08:05:25,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578608669] [2022-03-20 08:05:25,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 08:05:25,033 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-20 08:05:25,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:05:25,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-20 08:05:25,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=2260, Unknown=4, NotChecked=306, Total=2970 [2022-03-20 08:05:25,046 INFO L87 Difference]: Start difference. First operand 277 states and 362 transitions. Second operand has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:05:25,971 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|)) (.cse1 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#Source~0.offset| 0) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (= (select .cse0 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Weight~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse1 |c_main_~#distance~0.offset|) 0) (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse3 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|)) (.cse2 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 4)) v_ArrVal_639))) (or (<= 0 (select (store .cse2 .cse3 v_ArrVal_640) |c_main_~#distance~0.offset|)) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= (select .cse2 .cse3) (let ((.cse4 (store |c_#memory_int| |c_main_~#distance~0.base| .cse2)) (.cse5 (* v_main_~j~0_53 4))) (+ (select (select .cse4 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse5)) (select .cse2 (+ (* (select (select .cse4 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse5)) 4) |c_main_~#distance~0.offset|))))) (<= 3 v_main_~j~0_53)))) (= c_main_~i~0 0) (= (select .cse1 (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (not (= |c_main_~#distance~0.base| |c_main_~#Source~0.base|)) (= |c_main_~#Weight~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 8)) 1) (<= 2 (select (select |c_#memory_int| |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 8))) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-03-20 08:05:26,744 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|)) (.cse1 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#Source~0.offset| 0) (= |c_main_~#distance~0.offset| 0) (= (select .cse0 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Weight~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse1 |c_main_~#distance~0.offset|) 0) (= (select .cse1 0) 0) (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse3 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|)) (.cse2 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 4)) v_ArrVal_639))) (or (<= 0 (select (store .cse2 .cse3 v_ArrVal_640) |c_main_~#distance~0.offset|)) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= (select .cse2 .cse3) (let ((.cse4 (store |c_#memory_int| |c_main_~#distance~0.base| .cse2)) (.cse5 (* v_main_~j~0_53 4))) (+ (select (select .cse4 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse5)) (select .cse2 (+ (* (select (select .cse4 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse5)) 4) |c_main_~#distance~0.offset|))))) (<= 3 v_main_~j~0_53)))) (not (= |c_main_~#distance~0.base| |c_main_~#Source~0.base|)) (= |c_main_~#Weight~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 8)) 1) (<= 2 (select (select |c_#memory_int| |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 8))))) is different from false [2022-03-20 08:05:27,529 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_main_~#distance~0.base|)) (.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|)) (.cse1 (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|))) (and (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#Source~0.offset| 0) (= .cse1 0) (= |c_main_~#distance~0.offset| 0) (= (select .cse0 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Weight~0.base|)) (= |c_main_~#Dest~0.offset| 0) (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_639)) (.cse3 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|))) (or (<= (select .cse2 .cse3) (let ((.cse4 (store |c_#memory_int| |c_main_~#distance~0.base| .cse2)) (.cse5 (* v_main_~j~0_53 4))) (+ (select .cse2 (+ (* (select (select .cse4 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse5)) 4) |c_main_~#distance~0.offset|)) (select (select .cse4 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse5))))) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= 0 (select (store .cse2 .cse3 v_ArrVal_640) |c_main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))) (= (select .cse6 |c_main_~#distance~0.offset|) 0) (= (select .cse6 0) 0) (= (select .cse0 .cse1) 1) (not (= |c_main_~#distance~0.base| |c_main_~#Source~0.base|)) (= |c_main_~#Weight~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 8)) 1) (<= 2 (select (select |c_#memory_int| |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 8))) (= c_main_~j~0 0))) is different from false [2022-03-20 08:05:28,316 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 |c_main_~#Dest~0.offset|)) (.cse2 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= .cse0 1) (= |c_main_~#Source~0.offset| 0) (= (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|) 0) (= |c_main_~#distance~0.offset| 0) (= .cse0 c_main_~x~0) (= (select .cse1 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (not (= |c_main_~#distance~0.base| |c_main_~#Weight~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse2 |c_main_~#distance~0.offset|) 0) (= (select .cse2 0) 0) (not (= |c_main_~#distance~0.base| |c_main_~#Source~0.base|)) (forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_ArrVal_639 Int) (v_main_~x~0_39 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* 4 c_main_~x~0) |c_main_~#distance~0.offset|) v_ArrVal_639)) (.cse4 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|))) (or (not (<= 0 (+ v_ArrVal_639 1))) (<= (select .cse3 .cse4) (let ((.cse5 (store |c_#memory_int| |c_main_~#distance~0.base| .cse3)) (.cse6 (* main_~j~0 4))) (+ (select (select .cse5 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse6)) (select .cse3 (+ (* (select (select .cse5 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse6)) 4) |c_main_~#distance~0.offset|))))) (<= 3 main_~j~0) (<= main_~j~0 1) (<= 0 (select (store .cse3 .cse4 v_ArrVal_640) |c_main_~#distance~0.offset|))))) (= |c_main_~#Weight~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 8)) 1) (<= 2 (select (select |c_#memory_int| |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 8))) (= (+ (- 1) c_main_~x~0) 0) (= c_main_~j~0 0)))) is different from false [2022-03-20 08:05:31,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:05:31,226 INFO L93 Difference]: Finished difference Result 388 states and 495 transitions. [2022-03-20 08:05:31,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-20 08:05:31,226 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-03-20 08:05:31,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:05:31,229 INFO L225 Difference]: With dead ends: 388 [2022-03-20 08:05:31,229 INFO L226 Difference]: Without dead ends: 360 [2022-03-20 08:05:31,231 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2773 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=1598, Invalid=9342, Unknown=8, NotChecked=1484, Total=12432 [2022-03-20 08:05:31,232 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 190 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 2337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1383 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 08:05:31,232 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 156 Invalid, 2337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 856 Invalid, 0 Unknown, 1383 Unchecked, 0.4s Time] [2022-03-20 08:05:31,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-03-20 08:05:31,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 294. [2022-03-20 08:05:31,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 283 states have (on average 1.3180212014134276) internal successors, (373), 285 states have internal predecessors, (373), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-20 08:05:31,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 383 transitions. [2022-03-20 08:05:31,306 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 383 transitions. Word has length 43 [2022-03-20 08:05:31,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:05:31,307 INFO L478 AbstractCegarLoop]: Abstraction has 294 states and 383 transitions. [2022-03-20 08:05:31,307 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:05:31,307 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 383 transitions. [2022-03-20 08:05:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-20 08:05:31,309 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:05:31,309 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:05:31,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-20 08:05:31,527 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:05:31,527 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:05:31,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:05:31,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1200415949, now seen corresponding path program 4 times [2022-03-20 08:05:31,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:05:31,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902461198] [2022-03-20 08:05:31,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:05:31,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:05:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:05:31,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:05:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:05:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-20 08:05:31,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:05:31,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902461198] [2022-03-20 08:05:31,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902461198] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 08:05:31,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977559716] [2022-03-20 08:05:31,832 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 08:05:31,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:05:31,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:05:31,833 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-20 08:05:31,834 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-20 08:05:31,957 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 08:05:31,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 08:05:31,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-20 08:05:31,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 08:05:31,973 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 54 treesize of output 50 [2022-03-20 08:05:32,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-03-20 08:05:32,366 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-03-20 08:05:32,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2022-03-20 08:05:48,741 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-03-20 08:05:48,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 28 treesize of output 13 [2022-03-20 08:05:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-20 08:05:48,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 08:06:04,195 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-20 08:06:04,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977559716] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 08:06:04,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 08:06:04,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 19] total 46 [2022-03-20 08:06:04,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457804232] [2022-03-20 08:06:04,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 08:06:04,197 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-20 08:06:04,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:06:04,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-20 08:06:04,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1781, Unknown=19, NotChecked=0, Total=2070 [2022-03-20 08:06:04,198 INFO L87 Difference]: Start difference. First operand 294 states and 383 transitions. Second operand has 46 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:06:19,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:06:19,415 INFO L93 Difference]: Finished difference Result 323 states and 414 transitions. [2022-03-20 08:06:19,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-20 08:06:19,415 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-03-20 08:06:19,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:06:19,416 INFO L225 Difference]: With dead ends: 323 [2022-03-20 08:06:19,416 INFO L226 Difference]: Without dead ends: 301 [2022-03-20 08:06:19,417 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 48 SyntacticMatches, 16 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 46.1s TimeCoverageRelationStatistics Valid=639, Invalid=3624, Unknown=27, NotChecked=0, Total=4290 [2022-03-20 08:06:19,418 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 83 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 504 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 08:06:19,418 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 152 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 318 Invalid, 0 Unknown, 504 Unchecked, 0.1s Time] [2022-03-20 08:06:19,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-03-20 08:06:19,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2022-03-20 08:06:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 286 states have (on average 1.3181818181818181) internal successors, (377), 288 states have internal predecessors, (377), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-20 08:06:19,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 387 transitions. [2022-03-20 08:06:19,449 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 387 transitions. Word has length 43 [2022-03-20 08:06:19,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:06:19,449 INFO L478 AbstractCegarLoop]: Abstraction has 297 states and 387 transitions. [2022-03-20 08:06:19,449 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:06:19,449 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 387 transitions. [2022-03-20 08:06:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-03-20 08:06:19,450 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:06:19,450 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:06:19,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-20 08:06:19,665 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:06:19,665 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:06:19,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:06:19,665 INFO L85 PathProgramCache]: Analyzing trace with hash -584884781, now seen corresponding path program 2 times [2022-03-20 08:06:19,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:06:19,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714612642] [2022-03-20 08:06:19,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:06:19,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:06:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:06:19,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:06:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:06:19,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 08:06:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:06:19,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-20 08:06:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:06:19,727 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-20 08:06:19,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:06:19,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714612642] [2022-03-20 08:06:19,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714612642] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 08:06:19,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4323354] [2022-03-20 08:06:19,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 08:06:19,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:06:19,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:06:19,729 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-20 08:06:19,755 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-20 08:06:19,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 08:06:19,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 08:06:19,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-20 08:06:19,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 08:06:19,929 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-20 08:06:19,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 08:06:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-20 08:06:20,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4323354] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 08:06:20,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 08:06:20,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-03-20 08:06:20,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493776067] [2022-03-20 08:06:20,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 08:06:20,005 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-20 08:06:20,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:06:20,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-20 08:06:20,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-03-20 08:06:20,006 INFO L87 Difference]: Start difference. First operand 297 states and 387 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-20 08:06:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:06:20,423 INFO L93 Difference]: Finished difference Result 881 states and 1162 transitions. [2022-03-20 08:06:20,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 08:06:20,423 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-03-20 08:06:20,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:06:20,426 INFO L225 Difference]: With dead ends: 881 [2022-03-20 08:06:20,426 INFO L226 Difference]: Without dead ends: 697 [2022-03-20 08:06:20,426 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2022-03-20 08:06:20,427 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 321 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 08:06:20,427 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 71 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 08:06:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-03-20 08:06:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 510. [2022-03-20 08:06:20,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 497 states have (on average 1.336016096579477) internal successors, (664), 500 states have internal predecessors, (664), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-20 08:06:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 678 transitions. [2022-03-20 08:06:20,496 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 678 transitions. Word has length 47 [2022-03-20 08:06:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:06:20,497 INFO L478 AbstractCegarLoop]: Abstraction has 510 states and 678 transitions. [2022-03-20 08:06:20,497 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-20 08:06:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 678 transitions. [2022-03-20 08:06:20,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-20 08:06:20,499 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:06:20,499 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:06:20,531 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-20 08:06:20,717 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:06:20,717 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:06:20,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:06:20,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2040872352, now seen corresponding path program 5 times [2022-03-20 08:06:20,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:06:20,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159465806] [2022-03-20 08:06:20,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:06:20,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:06:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:06:20,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:06:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:06:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:06:20,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:06:20,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159465806] [2022-03-20 08:06:20,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159465806] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 08:06:20,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883471839] [2022-03-20 08:06:20,824 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-20 08:06:20,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:06:20,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:06:20,825 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-20 08:06:20,826 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-20 08:06:21,130 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-20 08:06:21,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 08:06:21,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-20 08:06:21,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 08:06:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:06:21,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 08:06:21,311 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:06:21,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883471839] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 08:06:21,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 08:06:21,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-03-20 08:06:21,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505009995] [2022-03-20 08:06:21,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 08:06:21,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-20 08:06:21,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:06:21,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-20 08:06:21,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-03-20 08:06:21,312 INFO L87 Difference]: Start difference. First operand 510 states and 678 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:06:21,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:06:21,958 INFO L93 Difference]: Finished difference Result 1169 states and 1532 transitions. [2022-03-20 08:06:21,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-20 08:06:21,959 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-03-20 08:06:21,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:06:21,962 INFO L225 Difference]: With dead ends: 1169 [2022-03-20 08:06:21,962 INFO L226 Difference]: Without dead ends: 1131 [2022-03-20 08:06:21,963 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=292, Invalid=898, Unknown=0, NotChecked=0, Total=1190 [2022-03-20 08:06:21,963 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 169 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 08:06:21,964 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 98 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 08:06:21,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2022-03-20 08:06:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 679. [2022-03-20 08:06:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 666 states have (on average 1.3693693693693694) internal successors, (912), 669 states have internal predecessors, (912), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-20 08:06:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 926 transitions. [2022-03-20 08:06:22,065 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 926 transitions. Word has length 46 [2022-03-20 08:06:22,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:06:22,065 INFO L478 AbstractCegarLoop]: Abstraction has 679 states and 926 transitions. [2022-03-20 08:06:22,066 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:06:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 926 transitions. [2022-03-20 08:06:22,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-20 08:06:22,067 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:06:22,067 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:06:22,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-03-20 08:06:22,272 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:06:22,272 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:06:22,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:06:22,273 INFO L85 PathProgramCache]: Analyzing trace with hash 640274542, now seen corresponding path program 3 times [2022-03-20 08:06:22,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:06:22,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277137891] [2022-03-20 08:06:22,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:06:22,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:06:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:06:22,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:06:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:06:22,337 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-20 08:06:22,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:06:22,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277137891] [2022-03-20 08:06:22,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277137891] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 08:06:22,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943497616] [2022-03-20 08:06:22,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 08:06:22,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:06:22,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:06:22,351 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 08:06:22,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-20 08:06:22,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-20 08:06:22,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 08:06:22,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-20 08:06:22,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 08:06:22,541 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 18 treesize of output 16 [2022-03-20 08:06:22,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:06:22,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:06:22,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:06:22,626 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-03-20 08:06:22,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 66 [2022-03-20 08:06:22,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:06:22,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:06:22,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:06:22,801 INFO L356 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2022-03-20 08:06:22,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 74 [2022-03-20 08:06:23,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:06:23,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:06:23,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 08:06:23,092 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-03-20 08:06:23,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 66 treesize of output 79 [2022-03-20 08:06:23,509 INFO L356 Elim1Store]: treesize reduction 160, result has 44.3 percent of original size [2022-03-20 08:06:23,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 6 disjoint index pairs (out of 66 index pairs), introduced 15 new quantified variables, introduced 32 case distinctions, treesize of input 103 treesize of output 180 [2022-03-20 08:06:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 08:06:28,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 08:06:55,076 WARN L833 $PredicateComparison]: unable to prove that (forall ((|main_~#distance~0.offset| Int) (v_ArrVal_826 Int) (v_ArrVal_824 Int) (v_ArrVal_821 Int)) (or (let ((.cse0 (let ((.cse2 (let ((.cse3 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ .cse3 |main_~#distance~0.offset|) v_ArrVal_821) (+ .cse3 |main_~#distance~0.offset| 4) v_ArrVal_824)))) (store .cse2 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse2) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_826)))) (let ((.cse1 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0))) (<= (select .cse0 (+ (* (select (select .cse1 |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) (+ (select .cse0 (+ (* (select (select .cse1 |c_main_~#Source~0.base|) |c_main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select .cse1 |c_main_~#Weight~0.base|) |c_main_~#Weight~0.offset|))))) (not (<= (+ v_ArrVal_826 1) 0)) (not (<= 0 v_ArrVal_821)))) is different from false [2022-03-20 08:06:55,144 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-03-20 08:06:55,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943497616] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 08:06:55,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 08:06:55,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19, 19] total 39 [2022-03-20 08:06:55,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872921460] [2022-03-20 08:06:55,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 08:06:55,145 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-20 08:06:55,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:06:55,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-20 08:06:55,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1251, Unknown=13, NotChecked=72, Total=1482 [2022-03-20 08:06:55,146 INFO L87 Difference]: Start difference. First operand 679 states and 926 transitions. Second operand has 39 states, 39 states have (on average 2.58974358974359) internal successors, (101), 38 states have internal predecessors, (101), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:07:02,758 WARN L232 SmtUtils]: Spent 7.54s on a formula simplification. DAG size of input: 87 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 08:07:38,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:07:38,050 INFO L93 Difference]: Finished difference Result 3144 states and 4030 transitions. [2022-03-20 08:07:38,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 363 states. [2022-03-20 08:07:38,051 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.58974358974359) internal successors, (101), 38 states have internal predecessors, (101), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-03-20 08:07:38,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:07:38,057 INFO L225 Difference]: With dead ends: 3144 [2022-03-20 08:07:38,057 INFO L226 Difference]: Without dead ends: 2499 [2022-03-20 08:07:38,070 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 395 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67362 ImplicationChecksByTransitivity, 66.1s TimeCoverageRelationStatistics Valid=12672, Invalid=143732, Unknown=20, NotChecked=788, Total=157212 [2022-03-20 08:07:38,071 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 1236 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 4558 mSolverCounterSat, 1050 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 7511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1050 IncrementalHoareTripleChecker+Valid, 4558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1903 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-03-20 08:07:38,072 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1236 Valid, 233 Invalid, 7511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1050 Valid, 4558 Invalid, 0 Unknown, 1903 Unchecked, 2.9s Time] [2022-03-20 08:07:38,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2022-03-20 08:07:38,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 835. [2022-03-20 08:07:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 822 states have (on average 1.3041362530413625) internal successors, (1072), 825 states have internal predecessors, (1072), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-20 08:07:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1086 transitions. [2022-03-20 08:07:38,231 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1086 transitions. Word has length 46 [2022-03-20 08:07:38,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:07:38,231 INFO L478 AbstractCegarLoop]: Abstraction has 835 states and 1086 transitions. [2022-03-20 08:07:38,231 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.58974358974359) internal successors, (101), 38 states have internal predecessors, (101), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:07:38,231 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1086 transitions. [2022-03-20 08:07:38,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-20 08:07:38,232 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:07:38,233 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:07:38,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-03-20 08:07:38,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:07:38,447 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:07:38,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:07:38,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1478646395, now seen corresponding path program 4 times [2022-03-20 08:07:38,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:07:38,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412223763] [2022-03-20 08:07:38,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:07:38,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:07:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:07:38,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 08:07:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 08:07:38,553 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-20 08:07:38,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 08:07:38,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412223763] [2022-03-20 08:07:38,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412223763] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 08:07:38,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037198392] [2022-03-20 08:07:38,553 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 08:07:38,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:07:38,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 08:07:38,576 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 08:07:38,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-20 08:07:38,698 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 08:07:38,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 08:07:38,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 08:07:38,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 08:07:38,822 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-20 08:07:38,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 08:07:38,939 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-20 08:07:38,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037198392] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 08:07:38,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 08:07:38,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 18 [2022-03-20 08:07:38,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130576862] [2022-03-20 08:07:38,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 08:07:38,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-20 08:07:38,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 08:07:38,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-20 08:07:38,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-03-20 08:07:38,943 INFO L87 Difference]: Start difference. First operand 835 states and 1086 transitions. Second operand has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 17 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:07:39,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 08:07:39,738 INFO L93 Difference]: Finished difference Result 1474 states and 1866 transitions. [2022-03-20 08:07:39,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-20 08:07:39,738 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 17 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-03-20 08:07:39,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 08:07:39,742 INFO L225 Difference]: With dead ends: 1474 [2022-03-20 08:07:39,742 INFO L226 Difference]: Without dead ends: 1353 [2022-03-20 08:07:39,742 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2022-03-20 08:07:39,743 INFO L913 BasicCegarLoop]: 101 mSDtfsCounter, 270 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 08:07:39,743 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 138 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 08:07:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2022-03-20 08:07:39,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 905. [2022-03-20 08:07:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 892 states have (on average 1.2937219730941705) internal successors, (1154), 895 states have internal predecessors, (1154), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-20 08:07:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1168 transitions. [2022-03-20 08:07:39,916 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1168 transitions. Word has length 46 [2022-03-20 08:07:39,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 08:07:39,916 INFO L478 AbstractCegarLoop]: Abstraction has 905 states and 1168 transitions. [2022-03-20 08:07:39,916 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 17 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 08:07:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1168 transitions. [2022-03-20 08:07:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-20 08:07:39,918 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 08:07:39,918 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:07:39,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-20 08:07:40,138 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 08:07:40,138 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 08:07:40,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 08:07:40,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2086273551, now seen corresponding path program 1 times [2022-03-20 08:07:40,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 08:07:40,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105208936] [2022-03-20 08:07:40,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 08:07:40,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 08:07:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-20 08:07:40,189 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-20 08:07:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-20 08:07:40,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-20 08:07:40,232 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-03-20 08:07:40,233 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 08:07:40,235 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-20 08:07:40,237 INFO L719 BasicCegarLoop]: Path program histogram: [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 08:07:40,239 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 08:07:40,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 08:07:40 BasicIcfg [2022-03-20 08:07:40,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 08:07:40,297 INFO L158 Benchmark]: Toolchain (without parser) took 272967.27ms. Allocated memory was 182.5MB in the beginning and 396.4MB in the end (delta: 213.9MB). Free memory was 122.4MB in the beginning and 279.5MB in the end (delta: -157.0MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. [2022-03-20 08:07:40,297 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 138.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 08:07:40,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.99ms. Allocated memory was 182.5MB in the beginning and 274.7MB in the end (delta: 92.3MB). Free memory was 122.2MB in the beginning and 244.7MB in the end (delta: -122.4MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2022-03-20 08:07:40,297 INFO L158 Benchmark]: Boogie Preprocessor took 39.89ms. Allocated memory is still 274.7MB. Free memory was 244.7MB in the beginning and 242.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 08:07:40,298 INFO L158 Benchmark]: RCFGBuilder took 364.22ms. Allocated memory is still 274.7MB. Free memory was 242.6MB in the beginning and 225.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-03-20 08:07:40,298 INFO L158 Benchmark]: IcfgTransformer took 25.44ms. Allocated memory is still 274.7MB. Free memory was 225.8MB in the beginning and 224.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-20 08:07:40,298 INFO L158 Benchmark]: TraceAbstraction took 272285.67ms. Allocated memory was 274.7MB in the beginning and 396.4MB in the end (delta: 121.6MB). Free memory was 223.7MB in the beginning and 279.5MB in the end (delta: -55.8MB). Peak memory consumption was 66.4MB. Max. memory is 8.0GB. [2022-03-20 08:07:40,299 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 138.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.99ms. Allocated memory was 182.5MB in the beginning and 274.7MB in the end (delta: 92.3MB). Free memory was 122.2MB in the beginning and 244.7MB in the end (delta: -122.4MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.89ms. Allocated memory is still 274.7MB. Free memory was 244.7MB in the beginning and 242.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 364.22ms. Allocated memory is still 274.7MB. Free memory was 242.6MB in the beginning and 225.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * IcfgTransformer took 25.44ms. Allocated memory is still 274.7MB. Free memory was 225.8MB in the beginning and 224.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 272285.67ms. Allocated memory was 274.7MB in the beginning and 396.4MB in the end (delta: 121.6MB). Free memory was 223.7MB in the beginning and 279.5MB in the end (delta: -55.8MB). Peak memory consumption was 66.4MB. 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 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int INFINITY = 899; VAL [\old(INFINITY)=901, INFINITY=899] [L18] int nodecount = __VERIFIER_nondet_int(); [L19] int edgecount = __VERIFIER_nondet_int(); [L20] COND FALSE !(!(0 <= nodecount && nodecount <= 4)) VAL [edgecount=1, INFINITY=899, nodecount=2] [L21] COND FALSE !(!(0 <= edgecount && edgecount <= 19)) [L22] int source = 0; [L23] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L24] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L25] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L26] int distance[5]; [L27] int x,y; [L28] int i,j; [L30] i = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L30] COND TRUE i < nodecount VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L31] COND TRUE i == source [L32] distance[i] = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L30] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L30] COND TRUE i < nodecount VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L31] COND FALSE !(i == source) [L35] distance[i] = INFINITY VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L30] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L30] COND FALSE !(i < nodecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L39] i = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L39] COND TRUE i < nodecount [L41] j = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L41] COND TRUE j < edgecount [L43] EXPR Dest[j] [L43] x = Dest[j] [L44] EXPR Source[j] [L44] y = Source[j] [L45] EXPR distance[x] [L45] EXPR distance[y] [L45] EXPR Weight[j] VAL [Dest={23:0}, distance={21:0}, distance[x]=899, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, source=0, Source={22:0}, Weight={25:0}, Weight[j]=0, x=1, y=0] [L45] COND TRUE distance[x] > distance[y] + Weight[j] [L47] distance[x] = -1 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L41] j++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L41] COND FALSE !(j < edgecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L39] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L39] COND TRUE i < nodecount [L41] j = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L41] COND TRUE j < edgecount [L43] EXPR Dest[j] [L43] x = Dest[j] [L44] EXPR Source[j] [L44] y = Source[j] [L45] EXPR distance[x] [L45] EXPR distance[y] [L45] EXPR Weight[j] VAL [Dest={23:0}, distance={21:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, source=0, Source={22:0}, Weight={25:0}, Weight[j]=0, x=1, y=0] [L45] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L41] j++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L41] COND FALSE !(j < edgecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L39] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L39] COND FALSE !(i < nodecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L51] i = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L51] COND TRUE i < edgecount [L53] EXPR Dest[i] [L53] x = Dest[i] [L54] EXPR Source[i] [L54] y = Source[i] [L55] EXPR distance[x] [L55] EXPR distance[y] [L55] EXPR Weight[i] VAL [Dest={23:0}, distance={21:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, Weight[i]=0, x=1, y=0] [L55] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L51] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L51] COND FALSE !(i < edgecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L61] i = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L61] COND TRUE i < nodecount [L63] EXPR distance[i] VAL [Dest={23:0}, distance={21:0}, distance[i]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L63] CALL __VERIFIER_assert(distance[i]>=0) VAL [\old(cond)=1, INFINITY=899] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, INFINITY=899] [L63] RET __VERIFIER_assert(distance[i]>=0) VAL [Dest={23:0}, distance={21:0}, distance[i]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L61] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L61] COND TRUE i < nodecount [L63] EXPR distance[i] VAL [Dest={23:0}, distance={21:0}, distance[i]=-1, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L63] CALL __VERIFIER_assert(distance[i]>=0) VAL [\old(cond)=0, INFINITY=899] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, INFINITY=899] [L12] reach_error() VAL [\old(cond)=0, cond=0, INFINITY=899] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 272.2s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 96.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4568 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4555 mSDsluCounter, 2455 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5793 IncrementalHoareTripleChecker+Unchecked, 1411 mSDsCounter, 2417 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13346 IncrementalHoareTripleChecker+Invalid, 21556 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2417 mSolverCounterUnsat, 1044 mSDtfsCounter, 13346 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2343 GetRequests, 1198 SyntacticMatches, 54 SemanticMatches, 1091 ConstructedPredicates, 27 IntricatePredicates, 0 DeprecatedPredicates, 76370 ImplicationChecksByTransitivity, 226.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=905occurred in iteration=23, InterpolantAutomatonStates: 727, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 3620 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 167.4s InterpolantComputationTime, 1570 NumberOfCodeBlocks, 1561 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 2136 ConstructedInterpolants, 198 QuantifiedInterpolants, 24543 SizeOfPredicates, 190 NumberOfNonLiveVariables, 5985 ConjunctsInSsa, 401 ConjunctsInUnsatCore, 60 InterpolantComputations, 5 PerfectInterpolantSequences, 363/920 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 RESULT: Ultimate proved your program to be incorrect! [2022-03-20 08:07:40,520 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-20 08:07:40,522 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 0 Received shutdown request...