/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/verifythis/duplets.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 09:07:12,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 09:07:12,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 09:07:12,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 09:07:12,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 09:07:12,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 09:07:12,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 09:07:12,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 09:07:12,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 09:07:12,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 09:07:12,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 09:07:12,817 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 09:07:12,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 09:07:12,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 09:07:12,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 09:07:12,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 09:07:12,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 09:07:12,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 09:07:12,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 09:07:12,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 09:07:12,823 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 09:07:12,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 09:07:12,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 09:07:12,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 09:07:12,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 09:07:12,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 09:07:12,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 09:07:12,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 09:07:12,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 09:07:12,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 09:07:12,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 09:07:12,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 09:07:12,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 09:07:12,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 09:07:12,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 09:07:12,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 09:07:12,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 09:07:12,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 09:07:12,832 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 09:07:12,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 09:07:12,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 09:07:12,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 09:07:12,834 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 09:07:12,848 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 09:07:12,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 09:07:12,849 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-20 09:07:12,849 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-20 09:07:12,849 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-20 09:07:12,849 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-20 09:07:12,850 INFO L138 SettingsManager]: * Use SBE=true [2022-03-20 09:07:12,850 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 09:07:12,850 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 09:07:12,850 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 09:07:12,850 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 09:07:12,850 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 09:07:12,850 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 09:07:12,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 09:07:12,851 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 09:07:12,851 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 09:07:12,851 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 09:07:12,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 09:07:12,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 09:07:12,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 09:07:12,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 09:07:12,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-20 09:07:12,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-20 09:07:12,852 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 09:07:12,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-20 09:07:12,852 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 09:07:12,852 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-03-20 09:07:12,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-03-20 09:07:12,853 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 09:07:12,853 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 09:07:13,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 09:07:13,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 09:07:13,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 09:07:13,035 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 09:07:13,047 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 09:07:13,048 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/duplets.c [2022-03-20 09:07:13,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac3dcfa21/50bef4870fbd4de2a81d0f72cbfa99cc/FLAG4bfc013fd [2022-03-20 09:07:13,415 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 09:07:13,415 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c [2022-03-20 09:07:13,420 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac3dcfa21/50bef4870fbd4de2a81d0f72cbfa99cc/FLAG4bfc013fd [2022-03-20 09:07:13,849 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac3dcfa21/50bef4870fbd4de2a81d0f72cbfa99cc [2022-03-20 09:07:13,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 09:07:13,851 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 09:07:13,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 09:07:13,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 09:07:13,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 09:07:13,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 09:07:13" (1/1) ... [2022-03-20 09:07:13,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@543f80b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:07:13, skipping insertion in model container [2022-03-20 09:07:13,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 09:07:13" (1/1) ... [2022-03-20 09:07:13,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 09:07:13,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 09:07:14,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c[485,498] [2022-03-20 09:07:14,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 09:07:14,041 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 09:07:14,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c[485,498] [2022-03-20 09:07:14,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 09:07:14,077 INFO L208 MainTranslator]: Completed translation [2022-03-20 09:07:14,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:07:14 WrapperNode [2022-03-20 09:07:14,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 09:07:14,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 09:07:14,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 09:07:14,080 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 09:07:14,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:07:14" (1/1) ... [2022-03-20 09:07:14,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:07:14" (1/1) ... [2022-03-20 09:07:14,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:07:14" (1/1) ... [2022-03-20 09:07:14,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:07:14" (1/1) ... [2022-03-20 09:07:14,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:07:14" (1/1) ... [2022-03-20 09:07:14,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:07:14" (1/1) ... [2022-03-20 09:07:14,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:07:14" (1/1) ... [2022-03-20 09:07:14,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 09:07:14,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 09:07:14,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 09:07:14,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 09:07:14,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:07:14" (1/1) ... [2022-03-20 09:07:14,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 09:07:14,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:07:14,148 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 09:07:14,151 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 09:07:14,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 09:07:14,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 09:07:14,175 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 09:07:14,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 09:07:14,175 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-20 09:07:14,175 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2022-03-20 09:07:14,175 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2022-03-20 09:07:14,176 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 09:07:14,176 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-03-20 09:07:14,176 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-03-20 09:07:14,176 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-03-20 09:07:14,176 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 09:07:14,176 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 09:07:14,176 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 09:07:14,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 09:07:14,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 09:07:14,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 09:07:14,177 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-20 09:07:14,177 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2022-03-20 09:07:14,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 09:07:14,177 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2022-03-20 09:07:14,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 09:07:14,177 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 09:07:14,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-20 09:07:14,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-20 09:07:14,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-03-20 09:07:14,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 09:07:14,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 09:07:14,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 09:07:14,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 09:07:14,231 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 09:07:14,232 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 09:07:14,414 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 09:07:14,418 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 09:07:14,419 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-20 09:07:14,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 09:07:14 BoogieIcfgContainer [2022-03-20 09:07:14,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 09:07:14,420 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 09:07:14,420 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 09:07:14,422 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 09:07:14,424 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 09:07:14" (1/1) ... [2022-03-20 09:07:14,425 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-03-20 09:07:14,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 09:07:14 BasicIcfg [2022-03-20 09:07:14,437 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 09:07:14,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 09:07:14,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 09:07:14,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 09:07:14,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 09:07:13" (1/4) ... [2022-03-20 09:07:14,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec22f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 09:07:14, skipping insertion in model container [2022-03-20 09:07:14,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:07:14" (2/4) ... [2022-03-20 09:07:14,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec22f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 09:07:14, skipping insertion in model container [2022-03-20 09:07:14,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 09:07:14" (3/4) ... [2022-03-20 09:07:14,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec22f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 09:07:14, skipping insertion in model container [2022-03-20 09:07:14,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 09:07:14" (4/4) ... [2022-03-20 09:07:14,443 INFO L111 eAbstractionObserver]: Analyzing ICFG duplets.cqvasr [2022-03-20 09:07:14,446 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-20 09:07:14,447 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 09:07:14,473 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 09:07:14,478 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 09:07:14,478 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 09:07:14,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-03-20 09:07:14,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-20 09:07:14,492 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:07:14,492 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:07:14,492 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:07:14,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:07:14,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1613559281, now seen corresponding path program 1 times [2022-03-20 09:07:14,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:07:14,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87143084] [2022-03-20 09:07:14,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:14,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:07:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:14,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:07:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:14,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:14,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:07:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:14,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:07:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:14,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:07:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:14,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:14,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:07:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:14,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:07:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 09:07:14,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:07:14,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87143084] [2022-03-20 09:07:14,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87143084] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 09:07:14,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 09:07:14,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 09:07:14,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775235513] [2022-03-20 09:07:14,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 09:07:14,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 09:07:14,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:07:14,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 09:07:14,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 09:07:14,692 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-03-20 09:07:14,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:07:14,799 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2022-03-20 09:07:14,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 09:07:14,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2022-03-20 09:07:14,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:07:14,807 INFO L225 Difference]: With dead ends: 113 [2022-03-20 09:07:14,807 INFO L226 Difference]: Without dead ends: 56 [2022-03-20 09:07:14,809 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 09:07:14,811 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 59 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 09:07:14,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 55 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 09:07:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-03-20 09:07:14,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2022-03-20 09:07:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-03-20 09:07:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-03-20 09:07:14,840 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 49 [2022-03-20 09:07:14,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:07:14,841 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-03-20 09:07:14,841 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-03-20 09:07:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-03-20 09:07:14,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-20 09:07:14,842 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:07:14,842 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:07:14,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 09:07:14,843 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:07:14,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:07:14,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1068751152, now seen corresponding path program 1 times [2022-03-20 09:07:14,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:07:14,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770301465] [2022-03-20 09:07:14,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:14,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:07:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:14,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:07:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:14,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:14,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:07:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:14,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:07:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:14,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:07:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:15,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:15,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:07:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:15,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:07:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:15,055 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-20 09:07:15,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:07:15,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770301465] [2022-03-20 09:07:15,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770301465] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:07:15,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846810085] [2022-03-20 09:07:15,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:15,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:07:15,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:07:15,068 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 09:07:15,103 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 09:07:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:15,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-20 09:07:15,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:07:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-20 09:07:15,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:07:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-20 09:07:15,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846810085] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 09:07:15,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 09:07:15,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 17 [2022-03-20 09:07:15,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083705596] [2022-03-20 09:07:15,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 09:07:15,697 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-20 09:07:15,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:07:15,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-20 09:07:15,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-03-20 09:07:15,698 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 17 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 8 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2022-03-20 09:07:16,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:07:16,080 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2022-03-20 09:07:16,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-20 09:07:16,080 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 8 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 49 [2022-03-20 09:07:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:07:16,081 INFO L225 Difference]: With dead ends: 84 [2022-03-20 09:07:16,081 INFO L226 Difference]: Without dead ends: 63 [2022-03-20 09:07:16,082 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2022-03-20 09:07:16,083 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 109 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 09:07:16,083 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 58 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 09:07:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-03-20 09:07:16,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2022-03-20 09:07:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-03-20 09:07:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-03-20 09:07:16,090 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 49 [2022-03-20 09:07:16,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:07:16,091 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-03-20 09:07:16,091 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 8 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2022-03-20 09:07:16,091 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-03-20 09:07:16,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-20 09:07:16,092 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:07:16,092 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:07:16,109 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 09:07:16,307 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:07:16,308 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:07:16,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:07:16,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1304641222, now seen corresponding path program 1 times [2022-03-20 09:07:16,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:07:16,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173331332] [2022-03-20 09:07:16,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:16,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:07:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:16,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:07:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:16,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:16,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:07:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:16,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:07:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:16,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:07:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:16,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:16,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:07:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:16,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:07:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:16,487 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 09:07:16,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:07:16,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173331332] [2022-03-20 09:07:16,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173331332] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 09:07:16,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 09:07:16,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 09:07:16,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588935658] [2022-03-20 09:07:16,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 09:07:16,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 09:07:16,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:07:16,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 09:07:16,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-20 09:07:16,489 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-20 09:07:16,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:07:16,741 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-03-20 09:07:16,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 09:07:16,742 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 50 [2022-03-20 09:07:16,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:07:16,743 INFO L225 Difference]: With dead ends: 75 [2022-03-20 09:07:16,743 INFO L226 Difference]: Without dead ends: 73 [2022-03-20 09:07:16,743 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-03-20 09:07:16,744 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 81 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 09:07:16,744 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 61 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 09:07:16,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-03-20 09:07:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2022-03-20 09:07:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-03-20 09:07:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2022-03-20 09:07:16,750 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 50 [2022-03-20 09:07:16,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:07:16,750 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2022-03-20 09:07:16,750 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-20 09:07:16,751 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-03-20 09:07:16,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-20 09:07:16,751 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:07:16,752 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:07:16,752 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 09:07:16,752 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:07:16,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:07:16,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1610834198, now seen corresponding path program 1 times [2022-03-20 09:07:16,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:07:16,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453849897] [2022-03-20 09:07:16,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:16,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:07:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:16,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:07:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:16,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:16,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:07:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:16,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:07:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:16,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:07:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:16,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:16,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:07:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:16,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:07:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-20 09:07:17,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:07:17,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453849897] [2022-03-20 09:07:17,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453849897] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:07:17,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971384816] [2022-03-20 09:07:17,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:17,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:07:17,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:07:17,018 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 09:07:17,019 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 09:07:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:17,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-20 09:07:17,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:07:17,259 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-20 09:07:17,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:07:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-20 09:07:17,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971384816] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-20 09:07:17,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-20 09:07:17,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15, 12] total 25 [2022-03-20 09:07:17,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425805108] [2022-03-20 09:07:17,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 09:07:17,704 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 09:07:17,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:07:17,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 09:07:17,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2022-03-20 09:07:17,704 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-03-20 09:07:17,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:07:17,813 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2022-03-20 09:07:17,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 09:07:17,814 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 52 [2022-03-20 09:07:17,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:07:17,815 INFO L225 Difference]: With dead ends: 104 [2022-03-20 09:07:17,815 INFO L226 Difference]: Without dead ends: 70 [2022-03-20 09:07:17,815 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2022-03-20 09:07:17,816 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 43 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 09:07:17,816 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 464 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 09:07:17,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-03-20 09:07:17,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-03-20 09:07:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-03-20 09:07:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-03-20 09:07:17,821 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 52 [2022-03-20 09:07:17,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:07:17,822 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-03-20 09:07:17,822 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-03-20 09:07:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-03-20 09:07:17,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-03-20 09:07:17,823 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:07:17,823 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:07:17,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-20 09:07:18,039 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-20 09:07:18,040 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:07:18,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:07:18,040 INFO L85 PathProgramCache]: Analyzing trace with hash -58927682, now seen corresponding path program 1 times [2022-03-20 09:07:18,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:07:18,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860307886] [2022-03-20 09:07:18,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:18,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:07:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:18,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:07:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:18,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:18,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:07:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:18,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:07:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:18,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:07:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:18,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:18,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:07:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:18,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:07:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 09:07:18,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:07:18,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860307886] [2022-03-20 09:07:18,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860307886] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:07:18,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714052980] [2022-03-20 09:07:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:18,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:07:18,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:07:18,119 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 09:07:18,120 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 09:07:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:18,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-20 09:07:18,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:07:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 09:07:18,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:07:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 09:07:18,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714052980] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 09:07:18,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 09:07:18,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2022-03-20 09:07:18,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071617324] [2022-03-20 09:07:18,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 09:07:18,313 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 09:07:18,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:07:18,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 09:07:18,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-20 09:07:18,314 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-20 09:07:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:07:18,471 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2022-03-20 09:07:18,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 09:07:18,472 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2022-03-20 09:07:18,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:07:18,473 INFO L225 Difference]: With dead ends: 88 [2022-03-20 09:07:18,473 INFO L226 Difference]: Without dead ends: 67 [2022-03-20 09:07:18,473 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-03-20 09:07:18,474 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 65 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 09:07:18,474 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 53 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 09:07:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-03-20 09:07:18,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-03-20 09:07:18,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-03-20 09:07:18,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-03-20 09:07:18,479 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 55 [2022-03-20 09:07:18,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:07:18,479 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-03-20 09:07:18,479 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-20 09:07:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-03-20 09:07:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-20 09:07:18,480 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:07:18,480 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:07:18,496 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 09:07:18,696 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:07:18,697 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:07:18,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:07:18,697 INFO L85 PathProgramCache]: Analyzing trace with hash 925124550, now seen corresponding path program 1 times [2022-03-20 09:07:18,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:07:18,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401790809] [2022-03-20 09:07:18,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:18,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:07:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:18,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:07:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:18,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:18,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:07:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:18,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:07:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:18,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:07:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:18,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:18,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:07:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:18,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:07:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:19,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-20 09:07:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 09:07:19,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:07:19,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401790809] [2022-03-20 09:07:19,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401790809] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:07:19,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441366666] [2022-03-20 09:07:19,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:19,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:07:19,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:07:19,018 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 09:07:19,019 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 09:07:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:19,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-20 09:07:19,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:07:19,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-20 09:07:19,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-03-20 09:07:19,272 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-20 09:07:19,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-03-20 09:07:19,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-03-20 09:07:19,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-03-20 09:07:19,400 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 09:07:19,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 09:07:19,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441366666] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 09:07:19,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 09:07:19,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 25 [2022-03-20 09:07:19,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590245230] [2022-03-20 09:07:19,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 09:07:19,401 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 09:07:19,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:07:19,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 09:07:19,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2022-03-20 09:07:19,401 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-03-20 09:07:19,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:07:19,567 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2022-03-20 09:07:19,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 09:07:19,567 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2022-03-20 09:07:19,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:07:19,568 INFO L225 Difference]: With dead ends: 85 [2022-03-20 09:07:19,568 INFO L226 Difference]: Without dead ends: 83 [2022-03-20 09:07:19,569 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2022-03-20 09:07:19,569 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 50 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 09:07:19,569 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 441 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 09:07:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-03-20 09:07:19,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2022-03-20 09:07:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 50 states have internal predecessors, (56), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-03-20 09:07:19,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2022-03-20 09:07:19,575 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 57 [2022-03-20 09:07:19,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:07:19,575 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2022-03-20 09:07:19,575 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-03-20 09:07:19,576 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2022-03-20 09:07:19,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-20 09:07:19,576 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:07:19,576 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:07:19,594 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 09:07:19,791 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:07:19,791 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:07:19,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:07:19,792 INFO L85 PathProgramCache]: Analyzing trace with hash 926048071, now seen corresponding path program 1 times [2022-03-20 09:07:19,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:07:19,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655691843] [2022-03-20 09:07:19,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:19,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:07:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:19,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:07:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:19,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:19,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:07:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:19,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:07:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:19,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:07:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:19,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:19,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:07:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:19,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:07:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:19,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-20 09:07:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:19,957 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 09:07:19,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:07:19,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655691843] [2022-03-20 09:07:19,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655691843] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 09:07:19,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 09:07:19,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 09:07:19,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598892417] [2022-03-20 09:07:19,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 09:07:19,958 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 09:07:19,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:07:19,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 09:07:19,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-03-20 09:07:19,959 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-03-20 09:07:20,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:07:20,285 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2022-03-20 09:07:20,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 09:07:20,286 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2022-03-20 09:07:20,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:07:20,287 INFO L225 Difference]: With dead ends: 106 [2022-03-20 09:07:20,287 INFO L226 Difference]: Without dead ends: 92 [2022-03-20 09:07:20,287 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-03-20 09:07:20,287 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 111 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 09:07:20,288 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 56 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 09:07:20,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-03-20 09:07:20,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2022-03-20 09:07:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 57 states have internal predecessors, (65), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-03-20 09:07:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2022-03-20 09:07:20,299 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 57 [2022-03-20 09:07:20,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:07:20,299 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2022-03-20 09:07:20,299 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-03-20 09:07:20,299 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2022-03-20 09:07:20,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-20 09:07:20,303 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:07:20,303 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:07:20,303 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-20 09:07:20,303 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:07:20,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:07:20,304 INFO L85 PathProgramCache]: Analyzing trace with hash -984079512, now seen corresponding path program 2 times [2022-03-20 09:07:20,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:07:20,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874858502] [2022-03-20 09:07:20,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:20,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:07:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:20,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:07:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:20,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:20,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:07:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:20,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:07:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:20,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:07:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:20,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:20,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:07:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:20,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:07:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-03-20 09:07:20,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:07:20,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874858502] [2022-03-20 09:07:20,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874858502] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:07:20,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636734293] [2022-03-20 09:07:20,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 09:07:20,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:07:20,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:07:20,944 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 09:07:20,984 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 09:07:21,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 09:07:21,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 09:07:21,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-20 09:07:21,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:07:21,239 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-03-20 09:07:21,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-03-20 09:07:22,530 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-03-20 09:07:22,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:07:22,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636734293] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:07:22,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 09:07:22,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 33 [2022-03-20 09:07:22,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857041778] [2022-03-20 09:07:22,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 09:07:22,646 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-20 09:07:22,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:07:22,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-20 09:07:22,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1029, Unknown=1, NotChecked=0, Total=1122 [2022-03-20 09:07:22,647 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand has 33 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 12 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-03-20 09:07:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:07:29,712 INFO L93 Difference]: Finished difference Result 129 states and 161 transitions. [2022-03-20 09:07:29,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-20 09:07:29,712 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 12 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 58 [2022-03-20 09:07:29,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:07:29,716 INFO L225 Difference]: With dead ends: 129 [2022-03-20 09:07:29,716 INFO L226 Difference]: Without dead ends: 108 [2022-03-20 09:07:29,717 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=269, Invalid=2810, Unknown=1, NotChecked=0, Total=3080 [2022-03-20 09:07:29,718 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 85 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 292 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 09:07:29,718 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 270 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 882 Invalid, 0 Unknown, 292 Unchecked, 0.4s Time] [2022-03-20 09:07:29,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-03-20 09:07:29,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2022-03-20 09:07:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 63 states have internal predecessors, (74), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-03-20 09:07:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2022-03-20 09:07:29,737 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 58 [2022-03-20 09:07:29,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:07:29,737 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2022-03-20 09:07:29,737 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 12 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-03-20 09:07:29,737 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-03-20 09:07:29,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-20 09:07:29,738 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:07:29,738 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:07:29,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-20 09:07:29,956 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 09:07:29,956 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:07:29,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:07:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1828813328, now seen corresponding path program 3 times [2022-03-20 09:07:29,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:07:29,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369876936] [2022-03-20 09:07:29,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:29,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:07:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:29,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:07:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:29,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:29,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:07:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:29,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:07:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:29,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:07:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:29,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:29,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:07:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:30,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:07:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 09:07:30,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:07:30,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369876936] [2022-03-20 09:07:30,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369876936] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:07:30,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474246728] [2022-03-20 09:07:30,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 09:07:30,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:07:30,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:07:30,044 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 09:07:30,045 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 09:07:30,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-20 09:07:30,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 09:07:30,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-20 09:07:30,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:07:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 09:07:30,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:07:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 09:07:30,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474246728] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 09:07:30,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 09:07:30,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 10 [2022-03-20 09:07:30,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970819862] [2022-03-20 09:07:30,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 09:07:30,297 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 09:07:30,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:07:30,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 09:07:30,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-03-20 09:07:30,298 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-20 09:07:30,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:07:30,569 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2022-03-20 09:07:30,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 09:07:30,569 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2022-03-20 09:07:30,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:07:30,570 INFO L225 Difference]: With dead ends: 145 [2022-03-20 09:07:30,570 INFO L226 Difference]: Without dead ends: 101 [2022-03-20 09:07:30,570 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2022-03-20 09:07:30,571 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 68 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 09:07:30,571 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 59 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 09:07:30,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-03-20 09:07:30,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2022-03-20 09:07:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 69 states have internal predecessors, (82), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-03-20 09:07:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2022-03-20 09:07:30,578 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 61 [2022-03-20 09:07:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:07:30,578 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2022-03-20 09:07:30,578 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-20 09:07:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2022-03-20 09:07:30,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-20 09:07:30,578 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:07:30,579 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:07:30,609 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 09:07:30,795 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 09:07:30,795 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:07:30,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:07:30,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1290066965, now seen corresponding path program 1 times [2022-03-20 09:07:30,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:07:30,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727073775] [2022-03-20 09:07:30,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:30,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:07:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:30,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:07:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:30,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:30,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:07:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:30,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:07:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:30,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:07:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:30,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:30,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:07:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:30,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:07:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:30,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-20 09:07:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:30,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-03-20 09:07:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:30,933 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-20 09:07:30,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:07:30,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727073775] [2022-03-20 09:07:30,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727073775] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 09:07:30,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 09:07:30,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 09:07:30,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173365376] [2022-03-20 09:07:30,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 09:07:30,934 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 09:07:30,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:07:30,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 09:07:30,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-03-20 09:07:30,935 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-03-20 09:07:31,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:07:31,265 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2022-03-20 09:07:31,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 09:07:31,265 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2022-03-20 09:07:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:07:31,266 INFO L225 Difference]: With dead ends: 111 [2022-03-20 09:07:31,267 INFO L226 Difference]: Without dead ends: 109 [2022-03-20 09:07:31,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2022-03-20 09:07:31,272 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 82 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 09:07:31,273 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 56 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 09:07:31,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-03-20 09:07:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2022-03-20 09:07:31,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 75 states have internal predecessors, (88), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2022-03-20 09:07:31,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2022-03-20 09:07:31,317 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 64 [2022-03-20 09:07:31,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:07:31,317 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2022-03-20 09:07:31,318 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-03-20 09:07:31,318 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-03-20 09:07:31,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-20 09:07:31,318 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:07:31,318 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:07:31,318 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-20 09:07:31,318 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:07:31,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:07:31,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1289143444, now seen corresponding path program 1 times [2022-03-20 09:07:31,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:07:31,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435298145] [2022-03-20 09:07:31,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:31,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:07:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:07:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:07:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:07:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:07:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:07:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:07:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-20 09:07:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-03-20 09:07:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,465 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-20 09:07:31,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:07:31,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435298145] [2022-03-20 09:07:31,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435298145] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 09:07:31,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 09:07:31,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 09:07:31,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978755791] [2022-03-20 09:07:31,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 09:07:31,466 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 09:07:31,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:07:31,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 09:07:31,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-20 09:07:31,466 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-03-20 09:07:31,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:07:31,740 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2022-03-20 09:07:31,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 09:07:31,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2022-03-20 09:07:31,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:07:31,742 INFO L225 Difference]: With dead ends: 118 [2022-03-20 09:07:31,742 INFO L226 Difference]: Without dead ends: 107 [2022-03-20 09:07:31,742 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-03-20 09:07:31,743 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 77 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 09:07:31,743 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 50 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 09:07:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-03-20 09:07:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2022-03-20 09:07:31,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 75 states have internal predecessors, (87), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2022-03-20 09:07:31,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2022-03-20 09:07:31,755 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 64 [2022-03-20 09:07:31,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:07:31,755 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2022-03-20 09:07:31,755 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-03-20 09:07:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2022-03-20 09:07:31,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-20 09:07:31,757 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:07:31,757 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:07:31,757 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-20 09:07:31,757 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:07:31,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:07:31,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1636548555, now seen corresponding path program 1 times [2022-03-20 09:07:31,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:07:31,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367288371] [2022-03-20 09:07:31,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:31,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:07:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:07:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:07:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:07:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:07:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:07:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:07:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-03-20 09:07:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 09:07:31,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:07:31,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367288371] [2022-03-20 09:07:31,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367288371] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:07:31,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192546086] [2022-03-20 09:07:31,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:31,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:07:31,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:07:31,834 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 09:07:31,835 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 09:07:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:31,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-20 09:07:31,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:07:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-20 09:07:31,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:07:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 09:07:32,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192546086] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 09:07:32,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 09:07:32,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 9 [2022-03-20 09:07:32,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816381871] [2022-03-20 09:07:32,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 09:07:32,080 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 09:07:32,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:07:32,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 09:07:32,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-20 09:07:32,080 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-03-20 09:07:32,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:07:32,330 INFO L93 Difference]: Finished difference Result 174 states and 211 transitions. [2022-03-20 09:07:32,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 09:07:32,331 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 63 [2022-03-20 09:07:32,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:07:32,331 INFO L225 Difference]: With dead ends: 174 [2022-03-20 09:07:32,331 INFO L226 Difference]: Without dead ends: 112 [2022-03-20 09:07:32,332 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-03-20 09:07:32,332 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 86 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 09:07:32,332 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 56 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 09:07:32,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-03-20 09:07:32,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2022-03-20 09:07:32,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.173913043478261) internal successors, (81), 72 states have internal predecessors, (81), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2022-03-20 09:07:32,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2022-03-20 09:07:32,339 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 63 [2022-03-20 09:07:32,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:07:32,339 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2022-03-20 09:07:32,339 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-03-20 09:07:32,339 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2022-03-20 09:07:32,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-03-20 09:07:32,340 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:07:32,340 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:07:32,358 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 09:07:32,555 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:07:32,556 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:07:32,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:07:32,556 INFO L85 PathProgramCache]: Analyzing trace with hash 937349773, now seen corresponding path program 2 times [2022-03-20 09:07:32,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:07:32,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876874350] [2022-03-20 09:07:32,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:32,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:07:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:32,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:07:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:32,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:32,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:07:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:32,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:07:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:32,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:07:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:32,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:32,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:07:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:32,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:07:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:32,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-03-20 09:07:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:32,766 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-03-20 09:07:32,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:07:32,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876874350] [2022-03-20 09:07:32,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876874350] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 09:07:32,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 09:07:32,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 09:07:32,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962035306] [2022-03-20 09:07:32,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 09:07:32,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 09:07:32,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:07:32,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 09:07:32,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-03-20 09:07:32,767 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-03-20 09:07:33,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:07:33,274 INFO L93 Difference]: Finished difference Result 126 states and 148 transitions. [2022-03-20 09:07:33,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 09:07:33,274 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-03-20 09:07:33,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:07:33,275 INFO L225 Difference]: With dead ends: 126 [2022-03-20 09:07:33,275 INFO L226 Difference]: Without dead ends: 108 [2022-03-20 09:07:33,275 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2022-03-20 09:07:33,276 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 78 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 09:07:33,276 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 69 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 09:07:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-03-20 09:07:33,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2022-03-20 09:07:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 64 states have internal predecessors, (71), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-03-20 09:07:33,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2022-03-20 09:07:33,282 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 66 [2022-03-20 09:07:33,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:07:33,282 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2022-03-20 09:07:33,282 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-03-20 09:07:33,282 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2022-03-20 09:07:33,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-03-20 09:07:33,282 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:07:33,283 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:07:33,283 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-20 09:07:33,283 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:07:33,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:07:33,283 INFO L85 PathProgramCache]: Analyzing trace with hash -455253687, now seen corresponding path program 1 times [2022-03-20 09:07:33,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:07:33,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546278842] [2022-03-20 09:07:33,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:33,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:07:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:33,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:07:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:33,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:33,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:07:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:33,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:07:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:33,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:07:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:33,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:33,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:07:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:33,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:07:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:33,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-20 09:07:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:33,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-03-20 09:07:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:33,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-03-20 09:07:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-20 09:07:33,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:07:33,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546278842] [2022-03-20 09:07:33,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546278842] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:07:33,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569632010] [2022-03-20 09:07:33,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:33,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:07:33,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:07:33,508 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 09:07:33,522 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 09:07:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:33,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-20 09:07:33,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:07:33,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-20 09:07:33,716 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-03-20 09:07:33,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-03-20 09:07:33,741 INFO L356 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-03-20 09:07:33,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 71 [2022-03-20 09:07:33,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-03-20 09:07:33,781 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 0 case distinctions, treesize of input 24 treesize of output 17 [2022-03-20 09:07:33,784 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 5 treesize of output 3 [2022-03-20 09:07:33,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-03-20 09:07:33,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2022-03-20 09:07:33,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-03-20 09:07:34,137 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-20 09:07:34,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2022-03-20 09:07:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-03-20 09:07:34,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:07:34,315 INFO L356 Elim1Store]: treesize reduction 28, result has 33.3 percent of original size [2022-03-20 09:07:34,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 52 [2022-03-20 09:07:34,319 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-20 09:07:34,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2022-03-20 09:07:34,326 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-20 09:07:34,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 63 [2022-03-20 09:07:34,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 75 [2022-03-20 09:07:34,334 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-20 09:07:34,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 57 [2022-03-20 09:07:34,341 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-20 09:07:34,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 53 [2022-03-20 09:07:34,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-20 09:07:34,391 INFO L356 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2022-03-20 09:07:34,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 94 treesize of output 87 [2022-03-20 09:07:34,411 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-20 09:07:34,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 195 treesize of output 215 [2022-03-20 09:07:34,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-20 09:07:34,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 216 [2022-03-20 09:07:34,468 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-20 09:07:34,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-03-20 09:07:34,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-20 09:07:34,556 INFO L356 Elim1Store]: treesize reduction 5, result has 16.7 percent of original size [2022-03-20 09:07:34,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2022-03-20 09:07:34,582 INFO L356 Elim1Store]: treesize reduction 5, result has 16.7 percent of original size [2022-03-20 09:07:34,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2022-03-20 09:07:34,843 INFO L356 Elim1Store]: treesize reduction 20, result has 64.9 percent of original size [2022-03-20 09:07:34,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 144 treesize of output 166 [2022-03-20 09:07:35,046 INFO L356 Elim1Store]: treesize reduction 20, result has 64.9 percent of original size [2022-03-20 09:07:35,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 137 treesize of output 162 [2022-03-20 09:07:35,208 INFO L356 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2022-03-20 09:07:35,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 144 treesize of output 1 [2022-03-20 09:07:35,352 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-20 09:07:35,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 78 [2022-03-20 09:07:35,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-20 09:07:35,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-03-20 09:07:35,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-03-20 09:07:35,555 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-20 09:07:35,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2022-03-20 09:07:35,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-20 09:07:35,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-20 09:07:35,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-20 09:07:35,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-20 09:07:35,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-20 09:07:35,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-20 09:07:35,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-03-20 09:07:35,694 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-20 09:07:35,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 09:07:35,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 09:07:35,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-03-20 09:07:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-03-20 09:07:35,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569632010] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-20 09:07:35,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-20 09:07:35,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16, 11] total 27 [2022-03-20 09:07:35,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884684297] [2022-03-20 09:07:35,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 09:07:35,894 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 09:07:35,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:07:35,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 09:07:35,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2022-03-20 09:07:35,894 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-03-20 09:07:36,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:07:36,040 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2022-03-20 09:07:36,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 09:07:36,040 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 70 [2022-03-20 09:07:36,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:07:36,041 INFO L225 Difference]: With dead ends: 110 [2022-03-20 09:07:36,041 INFO L226 Difference]: Without dead ends: 108 [2022-03-20 09:07:36,041 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 143 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2022-03-20 09:07:36,042 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 39 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 09:07:36,042 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 415 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 09:07:36,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-03-20 09:07:36,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2022-03-20 09:07:36,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.125) internal successors, (81), 75 states have internal predecessors, (81), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-03-20 09:07:36,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2022-03-20 09:07:36,048 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 70 [2022-03-20 09:07:36,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:07:36,048 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2022-03-20 09:07:36,048 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-03-20 09:07:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2022-03-20 09:07:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-03-20 09:07:36,049 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:07:36,049 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:07:36,066 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 09:07:36,249 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-20 09:07:36,249 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:07:36,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:07:36,250 INFO L85 PathProgramCache]: Analyzing trace with hash -633726750, now seen corresponding path program 4 times [2022-03-20 09:07:36,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:07:36,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275442104] [2022-03-20 09:07:36,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:07:36,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:07:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:36,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:07:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:36,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:36,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:07:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:36,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:07:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:37,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:07:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:37,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:07:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:37,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:07:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:37,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:07:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:07:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-03-20 09:07:39,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:07:39,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275442104] [2022-03-20 09:07:39,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275442104] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:07:39,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821053708] [2022-03-20 09:07:39,298 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 09:07:39,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:07:39,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:07:39,299 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 09:07:39,300 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 09:07:39,377 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 09:07:39,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 09:07:39,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-20 09:07:39,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:07:39,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-03-20 09:07:49,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-03-20 09:07:50,879 WARN L855 $PredicateComparison]: unable to prove that (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~i~0 c_main_~n~0) (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (< mkdup_~j~0 c_main_~n~0) (<= 0 mkdup_~i~0) (= (store (store ((as const (Array Int Int)) 0) (+ c_main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ (* mkdup_~j~0 4) c_main_~a~0.offset) mkdup_~x~0) (select |c_#memory_int| c_main_~a~0.base)))) is different from true [2022-03-20 09:07:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-03-20 09:07:53,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:07:53,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821053708] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:07:53,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 09:07:53,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 46 [2022-03-20 09:07:53,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731354506] [2022-03-20 09:07:53,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 09:07:53,256 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-20 09:07:53,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:07:53,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-20 09:07:53,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1876, Unknown=8, NotChecked=88, Total=2162 [2022-03-20 09:07:53,257 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand has 46 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 39 states have internal predecessors, (68), 9 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2022-03-20 09:08:08,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:08:08,858 INFO L93 Difference]: Finished difference Result 165 states and 199 transitions. [2022-03-20 09:08:08,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-20 09:08:08,860 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 39 states have internal predecessors, (68), 9 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) Word has length 67 [2022-03-20 09:08:08,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:08:08,861 INFO L225 Difference]: With dead ends: 165 [2022-03-20 09:08:08,861 INFO L226 Difference]: Without dead ends: 131 [2022-03-20 09:08:08,862 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1655 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=543, Invalid=5606, Unknown=17, NotChecked=154, Total=6320 [2022-03-20 09:08:08,862 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 156 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 2151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 340 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-20 09:08:08,863 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 241 Invalid, 2151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1700 Invalid, 0 Unknown, 340 Unchecked, 1.2s Time] [2022-03-20 09:08:08,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-03-20 09:08:08,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 115. [2022-03-20 09:08:08,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.1481481481481481) internal successors, (93), 84 states have internal predecessors, (93), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-03-20 09:08:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 135 transitions. [2022-03-20 09:08:08,871 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 135 transitions. Word has length 67 [2022-03-20 09:08:08,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:08:08,871 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 135 transitions. [2022-03-20 09:08:08,871 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 39 states have internal predecessors, (68), 9 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2022-03-20 09:08:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2022-03-20 09:08:08,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-03-20 09:08:08,871 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:08:08,872 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:08:08,895 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 09:08:09,094 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-20 09:08:09,095 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:08:09,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:08:09,096 INFO L85 PathProgramCache]: Analyzing trace with hash -516817935, now seen corresponding path program 1 times [2022-03-20 09:08:09,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:08:09,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528964432] [2022-03-20 09:08:09,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:08:09,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:08:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:09,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:08:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:09,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:08:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:09,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:08:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:09,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:08:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:09,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:08:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:09,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:08:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:09,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:08:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:09,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:08:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:09,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-03-20 09:08:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:09,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-03-20 09:08:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:09,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-03-20 09:08:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-20 09:08:09,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:08:09,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528964432] [2022-03-20 09:08:09,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528964432] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:08:09,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331366135] [2022-03-20 09:08:09,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:08:09,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:08:09,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:08:09,350 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 09:08:09,354 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 09:08:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:09,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-20 09:08:09,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:08:09,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-20 09:08:09,624 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-03-20 09:08:09,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2022-03-20 09:08:09,909 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-20 09:08:09,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2022-03-20 09:08:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-03-20 09:08:09,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:08:10,159 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-03-20 09:08:10,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 670 treesize of output 606 [2022-03-20 09:08:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-03-20 09:08:10,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331366135] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 09:08:10,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 09:08:10,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 11] total 31 [2022-03-20 09:08:10,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788393545] [2022-03-20 09:08:10,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 09:08:10,662 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-20 09:08:10,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:08:10,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-20 09:08:10,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2022-03-20 09:08:10,664 INFO L87 Difference]: Start difference. First operand 115 states and 135 transitions. Second operand has 31 states, 25 states have (on average 2.92) internal successors, (73), 27 states have internal predecessors, (73), 10 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) [2022-03-20 09:08:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:08:12,112 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2022-03-20 09:08:12,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-20 09:08:12,112 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 2.92) internal successors, (73), 27 states have internal predecessors, (73), 10 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) Word has length 73 [2022-03-20 09:08:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:08:12,113 INFO L225 Difference]: With dead ends: 181 [2022-03-20 09:08:12,113 INFO L226 Difference]: Without dead ends: 179 [2022-03-20 09:08:12,114 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 149 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=430, Invalid=3230, Unknown=0, NotChecked=0, Total=3660 [2022-03-20 09:08:12,114 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 215 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-20 09:08:12,115 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 76 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1350 Invalid, 0 Unknown, 124 Unchecked, 0.6s Time] [2022-03-20 09:08:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-03-20 09:08:12,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 139. [2022-03-20 09:08:12,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 98 states have (on average 1.1428571428571428) internal successors, (112), 102 states have internal predecessors, (112), 24 states have call successors, (24), 14 states have call predecessors, (24), 16 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2022-03-20 09:08:12,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 161 transitions. [2022-03-20 09:08:12,124 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 161 transitions. Word has length 73 [2022-03-20 09:08:12,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:08:12,124 INFO L478 AbstractCegarLoop]: Abstraction has 139 states and 161 transitions. [2022-03-20 09:08:12,124 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 2.92) internal successors, (73), 27 states have internal predecessors, (73), 10 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) [2022-03-20 09:08:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 161 transitions. [2022-03-20 09:08:12,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-20 09:08:12,125 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:08:12,125 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:08:12,161 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 09:08:12,325 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-20 09:08:12,326 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:08:12,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:08:12,326 INFO L85 PathProgramCache]: Analyzing trace with hash -2020932442, now seen corresponding path program 1 times [2022-03-20 09:08:12,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:08:12,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789034551] [2022-03-20 09:08:12,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:08:12,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:08:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:12,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:08:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:12,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:08:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:12,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:08:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:12,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:08:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:12,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:08:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:12,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:08:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:12,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:08:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:12,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:08:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:12,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-20 09:08:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:12,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-03-20 09:08:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:12,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-03-20 09:08:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:12,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-03-20 09:08:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-03-20 09:08:12,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:08:12,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789034551] [2022-03-20 09:08:12,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789034551] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:08:12,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168217673] [2022-03-20 09:08:12,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:08:12,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:08:12,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:08:12,714 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 09:08:12,715 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 09:08:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:08:12,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 118 conjunts are in the unsatisfiable core [2022-03-20 09:08:12,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:08:12,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-03-20 09:08:12,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-20 09:08:15,134 WARN L855 $PredicateComparison]: unable to prove that (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (= (store |c_old(#memory_int)| |c_mkdup_#in~a.base| (store (store (select |c_old(#memory_int)| |c_mkdup_#in~a.base|) (+ |c_mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ (* mkdup_~j~0 4) |c_mkdup_#in~a.offset|) mkdup_~x~0)) |c_#memory_int|) (<= 0 mkdup_~i~0))) is different from true [2022-03-20 09:08:15,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-03-20 09:08:19,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-20 09:08:21,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 09:08:21,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2022-03-20 09:08:21,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 09:08:21,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 09:08:21,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2022-03-20 09:08:21,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-03-20 09:08:21,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-03-20 09:09:43,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 09:09:43,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 09:09:43,468 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-20 09:09:43,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 47 [2022-03-20 09:09:43,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-03-20 09:09:43,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-03-20 09:09:43,597 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-03-20 09:09:43,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:09:56,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-20 09:09:56,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-20 09:10:04,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168217673] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:10:04,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 09:10:04,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 39 [2022-03-20 09:10:04,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841640390] [2022-03-20 09:10:04,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 09:10:04,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-20 09:10:04,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:10:04,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-20 09:10:04,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2163, Unknown=20, NotChecked=94, Total=2450 [2022-03-20 09:10:04,944 INFO L87 Difference]: Start difference. First operand 139 states and 161 transitions. Second operand has 39 states, 31 states have (on average 2.032258064516129) internal successors, (63), 29 states have internal predecessors, (63), 13 states have call successors, (26), 6 states have call predecessors, (26), 8 states have return successors, (22), 12 states have call predecessors, (22), 12 states have call successors, (22) [2022-03-20 09:11:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:11:07,250 INFO L93 Difference]: Finished difference Result 189 states and 214 transitions. [2022-03-20 09:11:07,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-20 09:11:07,250 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 2.032258064516129) internal successors, (63), 29 states have internal predecessors, (63), 13 states have call successors, (26), 6 states have call predecessors, (26), 8 states have return successors, (22), 12 states have call predecessors, (22), 12 states have call successors, (22) Word has length 76 [2022-03-20 09:11:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:11:07,251 INFO L225 Difference]: With dead ends: 189 [2022-03-20 09:11:07,251 INFO L226 Difference]: Without dead ends: 117 [2022-03-20 09:11:07,252 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 99 SyntacticMatches, 10 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 170.2s TimeCoverageRelationStatistics Valid=409, Invalid=5244, Unknown=51, NotChecked=148, Total=5852 [2022-03-20 09:11:07,252 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 118 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 356 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-20 09:11:07,253 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 211 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1516 Invalid, 0 Unknown, 356 Unchecked, 0.7s Time] [2022-03-20 09:11:07,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-03-20 09:11:07,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2022-03-20 09:11:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 85 states have internal predecessors, (93), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-03-20 09:11:07,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2022-03-20 09:11:07,261 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 76 [2022-03-20 09:11:07,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:11:07,261 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2022-03-20 09:11:07,261 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 2.032258064516129) internal successors, (63), 29 states have internal predecessors, (63), 13 states have call successors, (26), 6 states have call predecessors, (26), 8 states have return successors, (22), 12 states have call predecessors, (22), 12 states have call successors, (22) [2022-03-20 09:11:07,261 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2022-03-20 09:11:07,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-20 09:11:07,262 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:11:07,262 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:11:07,291 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 09:11:07,462 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-20 09:11:07,463 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:11:07,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:11:07,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1723575464, now seen corresponding path program 5 times [2022-03-20 09:11:07,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:11:07,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099479051] [2022-03-20 09:11:07,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:11:07,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:11:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:11:07,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:11:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:11:07,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:11:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:11:07,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:11:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:11:07,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:11:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:11:07,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:11:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:11:07,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:11:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:11:07,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:11:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:11:07,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:11:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:11:07,545 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 43 proven. 15 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-03-20 09:11:07,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:11:07,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099479051] [2022-03-20 09:11:07,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099479051] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:11:07,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487204950] [2022-03-20 09:11:07,545 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-20 09:11:07,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:11:07,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:11:07,546 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 09:11:07,547 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 09:11:07,618 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-20 09:11:07,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 09:11:07,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-20 09:11:07,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:11:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 43 proven. 15 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-03-20 09:11:07,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:11:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 43 proven. 15 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-03-20 09:11:07,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487204950] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 09:11:07,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 09:11:07,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 11 [2022-03-20 09:11:07,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139963782] [2022-03-20 09:11:07,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 09:11:07,831 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 09:11:07,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:11:07,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 09:11:07,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-03-20 09:11:07,832 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-20 09:11:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:11:08,163 INFO L93 Difference]: Finished difference Result 217 states and 256 transitions. [2022-03-20 09:11:08,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-20 09:11:08,163 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2022-03-20 09:11:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:11:08,164 INFO L225 Difference]: With dead ends: 217 [2022-03-20 09:11:08,164 INFO L226 Difference]: Without dead ends: 141 [2022-03-20 09:11:08,164 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-03-20 09:11:08,164 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 105 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 09:11:08,165 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 59 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 09:11:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-03-20 09:11:08,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2022-03-20 09:11:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-03-20 09:11:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2022-03-20 09:11:08,175 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 76 [2022-03-20 09:11:08,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:11:08,175 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2022-03-20 09:11:08,175 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-20 09:11:08,175 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2022-03-20 09:11:08,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-03-20 09:11:08,176 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:11:08,176 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:11:08,194 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 09:11:08,392 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-20 09:11:08,392 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:11:08,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:11:08,392 INFO L85 PathProgramCache]: Analyzing trace with hash 181119312, now seen corresponding path program 6 times [2022-03-20 09:11:08,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:11:08,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996636679] [2022-03-20 09:11:08,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:11:08,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:11:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:11:08,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:11:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:11:08,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:11:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:11:08,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:11:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:11:08,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:11:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:11:08,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:11:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:11:08,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:11:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:11:08,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:11:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:11:08,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:11:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:11:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 14 proven. 83 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-03-20 09:11:14,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:11:14,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996636679] [2022-03-20 09:11:14,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996636679] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:11:14,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018760693] [2022-03-20 09:11:14,237 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-20 09:11:14,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:11:14,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:11:14,238 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 09:11:14,239 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 09:11:14,340 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-20 09:11:14,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 09:11:14,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 101 conjunts are in the unsatisfiable core [2022-03-20 09:11:14,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:11:14,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-03-20 09:11:31,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-03-20 09:11:49,390 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 81 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-03-20 09:11:49,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:11:49,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018760693] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:11:49,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 09:11:49,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 38] total 67 [2022-03-20 09:11:49,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739889688] [2022-03-20 09:11:49,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 09:11:49,821 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-03-20 09:11:49,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:11:49,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-03-20 09:11:49,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=4234, Unknown=16, NotChecked=0, Total=4556 [2022-03-20 09:11:49,822 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 67 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 59 states have internal predecessors, (94), 11 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) [2022-03-20 09:14:36,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:14:36,709 INFO L93 Difference]: Finished difference Result 166 states and 196 transitions. [2022-03-20 09:14:36,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-20 09:14:36,709 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 59 states have internal predecessors, (94), 11 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) Word has length 79 [2022-03-20 09:14:36,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:14:36,710 INFO L225 Difference]: With dead ends: 166 [2022-03-20 09:14:36,710 INFO L226 Difference]: Without dead ends: 132 [2022-03-20 09:14:36,713 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5201 ImplicationChecksByTransitivity, 201.7s TimeCoverageRelationStatistics Valid=1009, Invalid=16196, Unknown=87, NotChecked=0, Total=17292 [2022-03-20 09:14:36,714 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 48 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 589 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-20 09:14:36,714 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 240 Invalid, 2168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1518 Invalid, 0 Unknown, 589 Unchecked, 1.5s Time] [2022-03-20 09:14:36,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-03-20 09:14:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2022-03-20 09:14:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 97 states have internal predecessors, (107), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-03-20 09:14:36,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2022-03-20 09:14:36,728 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 149 transitions. Word has length 79 [2022-03-20 09:14:36,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:14:36,728 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 149 transitions. [2022-03-20 09:14:36,729 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 59 states have internal predecessors, (94), 11 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) [2022-03-20 09:14:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2022-03-20 09:14:36,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-03-20 09:14:36,729 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:14:36,729 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:14:36,751 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 09:14:36,943 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:14:36,944 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:14:36,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:14:36,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1729343584, now seen corresponding path program 1 times [2022-03-20 09:14:36,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:14:36,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683430428] [2022-03-20 09:14:36,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:14:36,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:14:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:37,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:14:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:37,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:14:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:37,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:14:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:37,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:14:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:14:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:37,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:14:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:37,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:14:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:37,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:14:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:37,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-03-20 09:14:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:37,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-03-20 09:14:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:37,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-03-20 09:14:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:37,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-03-20 09:14:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:37,262 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-03-20 09:14:37,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:14:37,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683430428] [2022-03-20 09:14:37,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683430428] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:14:37,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280028961] [2022-03-20 09:14:37,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:14:37,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:14:37,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:14:37,264 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 09:14:37,264 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 09:14:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:37,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 86 conjunts are in the unsatisfiable core [2022-03-20 09:14:37,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:14:37,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-20 09:14:37,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-20 09:14:37,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 09:14:37,588 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-03-20 09:14:37,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 18 [2022-03-20 09:14:37,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 09:14:37,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 09:14:37,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2022-03-20 09:14:37,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 09:14:37,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2022-03-20 09:14:37,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-03-20 09:14:37,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-03-20 09:14:40,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 09:14:40,902 INFO L356 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-03-20 09:14:40,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 36 [2022-03-20 09:14:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-03-20 09:14:40,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:14:41,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280028961] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:14:41,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 09:14:41,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2022-03-20 09:14:41,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445829520] [2022-03-20 09:14:41,225 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 09:14:41,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-20 09:14:41,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:14:41,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-20 09:14:41,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2022-03-20 09:14:41,226 INFO L87 Difference]: Start difference. First operand 128 states and 149 transitions. Second operand has 29 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 10 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) [2022-03-20 09:14:42,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:14:42,135 INFO L93 Difference]: Finished difference Result 182 states and 207 transitions. [2022-03-20 09:14:42,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-20 09:14:42,136 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 10 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) Word has length 85 [2022-03-20 09:14:42,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:14:42,137 INFO L225 Difference]: With dead ends: 182 [2022-03-20 09:14:42,137 INFO L226 Difference]: Without dead ends: 121 [2022-03-20 09:14:42,139 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 116 SyntacticMatches, 12 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=314, Invalid=2992, Unknown=0, NotChecked=0, Total=3306 [2022-03-20 09:14:42,140 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 133 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 347 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 09:14:42,141 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 224 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1062 Invalid, 0 Unknown, 347 Unchecked, 0.4s Time] [2022-03-20 09:14:42,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-03-20 09:14:42,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2022-03-20 09:14:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 86 states have internal predecessors, (92), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (16), 16 states have call predecessors, (16), 15 states have call successors, (16) [2022-03-20 09:14:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2022-03-20 09:14:42,178 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 85 [2022-03-20 09:14:42,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:14:42,178 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2022-03-20 09:14:42,178 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 10 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) [2022-03-20 09:14:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2022-03-20 09:14:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-20 09:14:42,179 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:14:42,179 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:14:42,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-03-20 09:14:42,393 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:14:42,393 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:14:42,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:14:42,394 INFO L85 PathProgramCache]: Analyzing trace with hash 74091419, now seen corresponding path program 1 times [2022-03-20 09:14:42,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:14:42,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197022141] [2022-03-20 09:14:42,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:14:42,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:14:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:42,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:14:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:42,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:14:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:42,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:14:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:42,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:14:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:42,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:14:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:42,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:14:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:42,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:14:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:42,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:14:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:42,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-03-20 09:14:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:42,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-03-20 09:14:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:42,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-03-20 09:14:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:42,507 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-03-20 09:14:42,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:14:42,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197022141] [2022-03-20 09:14:42,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197022141] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:14:42,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931799227] [2022-03-20 09:14:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:14:42,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:14:42,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:14:42,509 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 09:14:42,510 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 09:14:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:42,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-20 09:14:42,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:14:42,694 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-03-20 09:14:42,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:14:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-03-20 09:14:42,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931799227] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 09:14:42,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 09:14:42,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 13 [2022-03-20 09:14:42,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731619274] [2022-03-20 09:14:42,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 09:14:42,841 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 09:14:42,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:14:42,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 09:14:42,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-03-20 09:14:42,841 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-03-20 09:14:43,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:14:43,187 INFO L93 Difference]: Finished difference Result 208 states and 234 transitions. [2022-03-20 09:14:43,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-20 09:14:43,188 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2022-03-20 09:14:43,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:14:43,188 INFO L225 Difference]: With dead ends: 208 [2022-03-20 09:14:43,188 INFO L226 Difference]: Without dead ends: 134 [2022-03-20 09:14:43,188 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2022-03-20 09:14:43,189 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 123 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 09:14:43,189 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 54 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 09:14:43,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-03-20 09:14:43,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2022-03-20 09:14:43,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 98 states have internal predecessors, (106), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (16), 16 states have call predecessors, (16), 15 states have call successors, (16) [2022-03-20 09:14:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2022-03-20 09:14:43,204 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 88 [2022-03-20 09:14:43,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:14:43,204 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2022-03-20 09:14:43,204 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-03-20 09:14:43,204 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2022-03-20 09:14:43,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-03-20 09:14:43,204 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:14:43,205 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:14:43,221 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 09:14:43,421 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:14:43,421 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:14:43,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:14:43,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1973629885, now seen corresponding path program 2 times [2022-03-20 09:14:43,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:14:43,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740027082] [2022-03-20 09:14:43,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:14:43,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:14:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:43,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:14:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:43,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:14:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:43,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:14:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:43,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:14:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:43,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:14:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:43,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:14:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:43,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:14:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:43,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:14:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:50,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-03-20 09:14:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:50,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-03-20 09:14:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:50,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-03-20 09:14:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:14:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 19 proven. 60 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-20 09:14:50,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:14:50,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740027082] [2022-03-20 09:14:50,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740027082] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:14:50,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231554575] [2022-03-20 09:14:50,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 09:14:50,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:14:50,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:14:50,632 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 09:14:50,645 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 09:14:50,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 09:14:50,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 09:14:50,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 101 conjunts are in the unsatisfiable core [2022-03-20 09:14:50,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:14:50,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-03-20 09:14:52,991 WARN L855 $PredicateComparison]: unable to prove that (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (not (= mkdup_~j~0 mkdup_~i~0)) (= (store |c_old(#memory_int)| |c_mkdup_#in~a.base| (store (store (select |c_old(#memory_int)| |c_mkdup_#in~a.base|) (+ |c_mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ (* mkdup_~j~0 4) |c_mkdup_#in~a.offset|) mkdup_~x~0)) |c_#memory_int|) (< mkdup_~i~0 |c_mkdup_#in~n|) (<= 0 mkdup_~i~0))) is different from true [2022-03-20 09:14:53,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-03-20 09:15:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 9 proven. 68 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-20 09:15:13,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:15:14,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231554575] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:15:14,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 09:15:14,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 38] total 64 [2022-03-20 09:15:14,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527347032] [2022-03-20 09:15:14,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 09:15:14,154 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-03-20 09:15:14,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:15:14,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-03-20 09:15:14,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=3633, Unknown=8, NotChecked=124, Total=4160 [2022-03-20 09:15:14,155 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand has 64 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 58 states have internal predecessors, (89), 8 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (19), 9 states have call predecessors, (19), 8 states have call successors, (19) [2022-03-20 09:15:36,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:15:36,325 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2022-03-20 09:15:36,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-20 09:15:36,326 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 58 states have internal predecessors, (89), 8 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (19), 9 states have call predecessors, (19), 8 states have call successors, (19) Word has length 91 [2022-03-20 09:15:36,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:15:36,326 INFO L225 Difference]: With dead ends: 150 [2022-03-20 09:15:36,326 INFO L226 Difference]: Without dead ends: 118 [2022-03-20 09:15:36,328 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4220 ImplicationChecksByTransitivity, 44.1s TimeCoverageRelationStatistics Valid=1170, Invalid=12391, Unknown=15, NotChecked=230, Total=13806 [2022-03-20 09:15:36,328 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 153 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2400 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 2400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 335 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-20 09:15:36,328 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 129 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 2400 Invalid, 0 Unknown, 335 Unchecked, 2.8s Time] [2022-03-20 09:15:36,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-03-20 09:15:36,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2022-03-20 09:15:36,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.1) internal successors, (88), 81 states have internal predecessors, (88), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-03-20 09:15:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2022-03-20 09:15:36,345 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 91 [2022-03-20 09:15:36,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:15:36,345 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2022-03-20 09:15:36,346 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 58 states have internal predecessors, (89), 8 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (19), 9 states have call predecessors, (19), 8 states have call successors, (19) [2022-03-20 09:15:36,346 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2022-03-20 09:15:36,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-20 09:15:36,346 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:15:36,346 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:15:36,364 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 09:15:36,560 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-03-20 09:15:36,560 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:15:36,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:15:36,560 INFO L85 PathProgramCache]: Analyzing trace with hash -507134286, now seen corresponding path program 7 times [2022-03-20 09:15:36,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:15:36,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211591776] [2022-03-20 09:15:36,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:15:36,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:15:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:15:36,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:15:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:15:36,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:15:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:15:36,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 09:15:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:15:36,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 09:15:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:15:36,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 09:15:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:15:36,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 09:15:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:15:36,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 09:15:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:15:36,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 09:15:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:15:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 107 proven. 22 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-03-20 09:15:36,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:15:36,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211591776] [2022-03-20 09:15:36,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211591776] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:15:36,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190447013] [2022-03-20 09:15:36,647 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-20 09:15:36,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:15:36,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:15:36,648 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 09:15:36,672 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 09:15:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:15:36,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-20 09:15:36,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:15:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 51 proven. 89 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-03-20 09:15:36,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:15:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 51 proven. 89 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-03-20 09:15:37,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190447013] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 09:15:37,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 09:15:37,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2022-03-20 09:15:37,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570814355] [2022-03-20 09:15:37,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 09:15:37,114 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 09:15:37,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:15:37,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 09:15:37,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-03-20 09:15:37,114 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-20 09:15:37,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:15:37,330 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-03-20 09:15:37,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-20 09:15:37,331 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 88 [2022-03-20 09:15:37,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:15:37,331 INFO L225 Difference]: With dead ends: 102 [2022-03-20 09:15:37,331 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 09:15:37,331 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 187 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2022-03-20 09:15:37,332 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 45 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 09:15:37,332 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 38 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 09:15:37,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 09:15:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 09:15:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-20 09:15:37,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 09:15:37,333 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2022-03-20 09:15:37,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:15:37,333 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 09:15:37,333 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-20 09:15:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 09:15:37,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 09:15:37,335 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 09:15:37,357 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 09:15:37,535 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:15:37,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-20 09:15:44,541 WARN L232 SmtUtils]: Spent 5.88s on a formula simplification. DAG size of input: 51 DAG size of output: 42 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-03-20 09:17:05,345 WARN L232 SmtUtils]: Spent 1.31m on a formula simplification. DAG size of input: 487 DAG size of output: 229 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-03-20 09:17:38,598 WARN L232 SmtUtils]: Spent 33.23s on a formula simplification. DAG size of input: 347 DAG size of output: 174 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-03-20 09:17:38,981 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-20 09:17:38,981 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-03-20 09:17:38,981 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-03-20 09:17:38,981 INFO L878 garLoopResultBuilder]: At program point mkdupENTRY(lines 19 31) the Hoare annotation is: (or (forall ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (or (not (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)) (not (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|)))) (= |#memory_int| |old(#memory_int)|)) [2022-03-20 09:17:38,982 INFO L878 garLoopResultBuilder]: At program point L23-1(line 23) the Hoare annotation is: (or (forall ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (or (not (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)) (not (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|)))) (and (= |mkdup_#in~n| mkdup_~n) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 |mkdup_#in~n|))) [2022-03-20 09:17:38,982 INFO L878 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (or (forall ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (or (not (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)) (not (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|)))) (and (= |mkdup_#in~n| mkdup_~n) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))) [2022-03-20 09:17:38,982 INFO L882 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2022-03-20 09:17:38,982 INFO L878 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (or (forall ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (or (not (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)) (not (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|)))) (and (= |mkdup_#in~n| mkdup_~n) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|))) [2022-03-20 09:17:38,982 INFO L882 garLoopResultBuilder]: For program point mkdupFINAL(lines 19 31) no Hoare annotation was computed. [2022-03-20 09:17:38,982 INFO L882 garLoopResultBuilder]: For program point mkdupEXIT(lines 19 31) no Hoare annotation was computed. [2022-03-20 09:17:38,982 INFO L878 garLoopResultBuilder]: At program point finddupENTRY(lines 33 46) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-03-20 09:17:38,982 INFO L878 garLoopResultBuilder]: At program point L36-3(lines 36 44) the Hoare annotation is: (let ((.cse38 (select |#memory_int| finddup_~a.base)) (.cse27 ((as const (Array Int Int)) 0))) (let ((.cse44 (@diff .cse38 .cse27))) (let ((.cse45 (store .cse38 .cse44 0))) (let ((.cse43 (@diff .cse45 .cse27)) (.cse42 (* finddup_~i~1 4))) (let ((.cse26 (+ finddup_~i~1 3)) (.cse14 (select .cse38 (+ finddup_~a.offset .cse42))) (.cse15 (not (= .cse27 (store .cse45 .cse43 0))))) (let ((.cse1 (or (= .cse14 (select .cse38 (+ finddup_~a.offset .cse42 4))) (and (not (= (select .cse38 .cse43) (select .cse38 .cse44))) (not (= .cse27 .cse45))) .cse15)) (.cse2 (exists ((v_finddup_~j~1_119 Int)) (let ((.cse40 (select |#memory_int| finddup_~a.base))) (let ((.cse39 (select .cse40 finddup_~a.offset)) (.cse41 (* v_finddup_~j~1_119 4))) (and (not (= .cse39 (select .cse40 (+ finddup_~a.offset .cse41 (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= .cse39 (select .cse40 (+ finddup_~a.offset .cse41))))))))) (.cse3 (= finddup_~i~1 1)) (.cse6 (not (= (select .cse38 finddup_~a.offset) (select .cse38 (+ finddup_~a.offset 4))))) (.cse10 (<= 3 finddup_~n)) (.cse23 (<= (+ finddup_~i~1 4) finddup_~n)) (.cse18 (not (let ((.cse37 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse37 (+ |finddup_#in~a.offset| 4)) (select .cse37 |finddup_#in~a.offset|))))) (.cse19 (exists ((v_finddup_~j~1_121 Int)) (and (<= finddup_~n (+ v_finddup_~j~1_121 1)) (not (let ((.cse36 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse36 (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select .cse36 (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4)))))) (< v_finddup_~j~1_121 finddup_~n)))) (.cse21 (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (let ((.cse35 (select |#memory_int| finddup_~a.base))) (= (select .cse35 (+ finddup_~a.offset 4)) (select .cse35 (+ finddup_~a.offset (* finddup_~j~1 4)))))) (< finddup_~j~1 finddup_~n)))) (.cse11 (<= finddup_~j~1 .cse26)) (.cse22 (exists ((v_finddup_~j~1_119 Int)) (let ((.cse32 (select |#memory_int| |finddup_#in~a.base|))) (let ((.cse33 (* v_finddup_~j~1_119 4)) (.cse34 (select .cse32 |finddup_#in~a.offset|))) (and (not (= (select .cse32 (+ .cse33 |finddup_#in~a.offset|)) .cse34)) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select .cse32 (+ .cse33 |finddup_#in~a.offset| (- 4))) .cse34)) (< v_finddup_~j~1_119 finddup_~n)))))) (.cse7 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse9 (= |finddup_#in~a.base| finddup_~a.base)) (.cse0 (= |#memory_int| |old(#memory_int)|)) (.cse4 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse5 (= |finddup_#in~n| finddup_~n)) (.cse24 (<= finddup_~j~1 (+ finddup_~i~1 1))) (.cse8 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse12 (<= finddup_~n finddup_~j~1)) (.cse13 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse16 (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (and (<= |finddup_#in~n| 1) .cse0) (and .cse1 .cse2 .cse3 .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (or (= .cse14 0) .cse15) .cse16) (and (let ((.cse20 (+ finddup_~i~1 2))) (let ((.cse17 (<= finddup_~j~1 .cse20))) (or (and .cse1 .cse2 .cse3 .cse0 .cse4 .cse5 .cse10 .cse17 .cse12) (and .cse0 .cse4 .cse5 .cse18 .cse19 (<= .cse20 finddup_~n) .cse17 .cse21 .cse12 .cse22)))) .cse7 .cse8 .cse9 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse0 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse16) (and .cse0 .cse4 .cse5 .cse24 .cse8 (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (let ((.cse25 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse25 (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select .cse25 (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|))))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))) .cse12 .cse13 .cse16) (and .cse0 .cse4 .cse5 .cse23 (<= 1 finddup_~i~1) .cse18 .cse19 .cse7 .cse8 .cse9 .cse21 .cse12 .cse22 .cse13 .cse16) (and .cse0 .cse4 .cse5 .cse18 .cse19 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse22 .cse13 .cse16 (<= .cse26 finddup_~n)) (and .cse0 .cse4 .cse5 (= finddup_~i~1 0) .cse7 .cse8 .cse9 .cse13 .cse16) (let ((.cse30 (select |old(#memory_int)| |finddup_#in~a.base|))) (let ((.cse31 (@diff .cse30 .cse27))) (let ((.cse28 (store .cse30 .cse31 0))) (and (let ((.cse29 (@diff .cse28 .cse27))) (or (not (= .cse27 (store .cse28 .cse29 0))) (not (= (select .cse30 .cse29) (select .cse30 .cse31))))) .cse0 .cse4 .cse5 .cse24 .cse8 (not (= .cse28 .cse27)) .cse12 .cse13 .cse16))))))))))) [2022-03-20 09:17:38,982 INFO L882 garLoopResultBuilder]: For program point L36-4(lines 36 44) no Hoare annotation was computed. [2022-03-20 09:17:38,982 INFO L878 garLoopResultBuilder]: At program point L37-3(lines 37 43) the Hoare annotation is: (let ((.cse7 (select |#memory_int| finddup_~a.base)) (.cse46 ((as const (Array Int Int)) 0))) (let ((.cse37 (* finddup_~i~1 4)) (.cse48 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse31 (@diff .cse7 .cse46))) (let ((.cse51 (store .cse7 .cse31 0)) (.cse22 (+ finddup_~i~1 2)) (.cse49 (@diff .cse48 .cse46)) (.cse30 (+ finddup_~a.offset .cse37))) (let ((.cse26 (* finddup_~j~1 4)) (.cse27 (select .cse7 .cse30)) (.cse45 (store .cse48 .cse49 0)) (.cse44 (= finddup_~i~1 0)) (.cse3 (= |#memory_int| |old(#memory_int)|)) (.cse4 (or (< finddup_~i~1 finddup_~n) (<= |finddup_#in~n| 0))) (.cse5 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse6 (= |finddup_#in~n| finddup_~n)) (.cse28 (<= .cse22 finddup_~j~1)) (.cse21 (<= 1 finddup_~i~1)) (.cse10 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse33 (@diff .cse51 .cse46)) (.cse43 (+ finddup_~i~1 1))) (let ((.cse12 (<= .cse43 finddup_~j~1)) (.cse24 (<= finddup_~j~1 .cse22)) (.cse16 (not (let ((.cse57 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse57 (+ |finddup_#in~a.offset| 4)) (select .cse57 |finddup_#in~a.offset|))))) (.cse29 (exists ((v_finddup_~j~1_121 Int)) (and (not (let ((.cse56 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse56 (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select .cse56 (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|))))) (< v_finddup_~j~1_121 finddup_~n) (<= finddup_~j~1 (+ v_finddup_~j~1_121 1))))) (.cse18 (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (let ((.cse55 (select |#memory_int| finddup_~a.base))) (= (select .cse55 (+ finddup_~a.offset 4)) (select .cse55 (+ finddup_~a.offset (* finddup_~j~1 4)))))) (< finddup_~j~1 finddup_~n)))) (.cse19 (exists ((v_finddup_~j~1_119 Int)) (let ((.cse52 (select |#memory_int| |finddup_#in~a.base|))) (let ((.cse53 (* v_finddup_~j~1_119 4)) (.cse54 (select .cse52 |finddup_#in~a.offset|))) (and (not (= (select .cse52 (+ .cse53 |finddup_#in~a.offset|)) .cse54)) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select .cse52 (+ .cse53 |finddup_#in~a.offset| (- 4))) .cse54)) (< v_finddup_~j~1_119 finddup_~n)))))) (.cse34 (not (= .cse46 (store .cse51 .cse33 0)))) (.cse35 (let ((.cse50 (<= (+ finddup_~i~1 3) finddup_~n))) (or (and .cse3 .cse4 .cse5 .cse6 .cse44 .cse28 .cse10 .cse50) (and .cse3 .cse4 .cse5 .cse6 .cse28 .cse21 .cse10 .cse50)))) (.cse20 (let ((.cse47 (@diff .cse45 .cse46))) (or (not (= .cse46 (store .cse45 .cse47 0))) (not (= (select .cse48 .cse47) (select .cse48 .cse49)))))) (.cse8 (<= finddup_~j~1 .cse43)) (.cse23 (not (= .cse45 .cse46))) (.cse25 (<= finddup_~n finddup_~j~1)) (.cse15 (<= 1 finddup_~j~1)) (.cse42 (not (= (select .cse7 (+ finddup_~a.offset .cse26 (- 4))) .cse27))) (.cse9 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse11 (= |finddup_#in~a.base| finddup_~a.base)) (.cse13 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse14 (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (and (exists ((v_finddup_~j~1_119 Int)) (let ((.cse1 (select |#memory_int| finddup_~a.base))) (let ((.cse0 (select .cse1 finddup_~a.offset)) (.cse2 (* v_finddup_~j~1_119 4))) (and (not (= .cse0 (select .cse1 (+ finddup_~a.offset .cse2 (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= .cse0 (select .cse1 (+ finddup_~a.offset .cse2)))))))) (= finddup_~i~1 1) .cse3 .cse4 .cse5 .cse6 (not (= (select .cse7 finddup_~a.offset) (select .cse7 (+ finddup_~a.offset 4)))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse3 .cse4 .cse5 .cse6 .cse15 .cse16 .cse8 (exists ((v_finddup_~j~1_121 Int)) (and (<= finddup_~n (+ v_finddup_~j~1_121 1)) (not (let ((.cse17 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse17 (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select .cse17 (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4)))))) (< v_finddup_~j~1_121 finddup_~n))) .cse9 .cse10 .cse11 .cse12 .cse18 .cse19 .cse13 .cse14) (and .cse20 .cse3 .cse4 .cse5 .cse6 .cse21 .cse10 (<= .cse22 finddup_~n) .cse23 .cse24 .cse25 .cse13 .cse14) (and (= (select .cse7 (+ finddup_~a.offset .cse26 4)) .cse27) (= .cse27 (select .cse7 (+ finddup_~a.offset .cse26))) .cse3 .cse4 .cse5 .cse6 .cse28 .cse21 .cse16 .cse9 .cse10 .cse29 .cse11 .cse24 .cse19 .cse13 .cse14) (and (<= |finddup_#in~n| 1) .cse3 .cse4) (and .cse16 .cse9 .cse29 (or (and (not (= .cse27 0)) .cse11 (let ((.cse32 (* (- 1) finddup_~a.offset))) (or (and (not (= .cse30 .cse31)) (<= (+ 3 (div (+ .cse32 .cse31) 4)) finddup_~j~1)) (and (<= (+ 3 (div (+ .cse33 .cse32) 4)) finddup_~j~1) (not (= .cse30 .cse33)))))) (and .cse11 .cse34)) .cse18 .cse35 .cse19 .cse13 .cse14) (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (let ((.cse36 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse36 (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select .cse36 (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|))))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))) .cse25 .cse13 .cse14) (let ((.cse38 (select .cse7 (+ finddup_~a.offset .cse37 4)))) (and (or (= (select .cse7 (+ finddup_~a.offset .cse37 8)) .cse38) (not (= (select .cse7 .cse33) .cse27)) (not (= .cse27 (select .cse7 .cse31))) .cse34) (= .cse37 0) (exists ((v_finddup_~j~1_119 Int)) (let ((.cse39 (select |#memory_int| finddup_~a.base))) (let ((.cse40 (* v_finddup_~j~1_119 4)) (.cse41 (select .cse39 (+ finddup_~a.offset (* finddup_~i~1 4))))) (and (not (= (select .cse39 (+ finddup_~a.offset .cse40)) .cse41)) (< v_finddup_~j~1_119 finddup_~n) (<= finddup_~j~1 (+ v_finddup_~j~1_119 1)) (not (= (select .cse39 (+ finddup_~a.offset .cse40 (- 4))) .cse41)))))) (not (= .cse27 .cse38)) .cse42 .cse9 .cse11 .cse35 .cse13 .cse14)) (and .cse20 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse23 .cse25 .cse13 .cse14) (and .cse3 .cse4 .cse5 .cse6 .cse15 .cse9 .cse10 (= finddup_~j~1 .cse43) .cse11 (<= finddup_~j~1 1) .cse13 .cse14) (and .cse3 .cse4 .cse5 .cse6 .cse44 .cse42 (= finddup_~j~1 .cse22) .cse9 .cse10 .cse11 .cse13 .cse14))))))) [2022-03-20 09:17:38,983 INFO L882 garLoopResultBuilder]: For program point finddupFINAL(lines 33 46) no Hoare annotation was computed. [2022-03-20 09:17:38,983 INFO L882 garLoopResultBuilder]: For program point L36-2(lines 36 44) no Hoare annotation was computed. [2022-03-20 09:17:38,983 INFO L882 garLoopResultBuilder]: For program point L38(lines 38 42) no Hoare annotation was computed. [2022-03-20 09:17:38,983 INFO L882 garLoopResultBuilder]: For program point finddupEXIT(lines 33 46) no Hoare annotation was computed. [2022-03-20 09:17:38,983 INFO L882 garLoopResultBuilder]: For program point L37-2(lines 37 43) no Hoare annotation was computed. [2022-03-20 09:17:38,983 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-20 09:17:38,983 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-20 09:17:38,983 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-03-20 09:17:38,983 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-03-20 09:17:38,983 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 15 17) the Hoare annotation is: true [2022-03-20 09:17:38,983 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-03-20 09:17:38,983 INFO L882 garLoopResultBuilder]: For program point L16-2(lines 15 17) no Hoare annotation was computed. [2022-03-20 09:17:38,983 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2022-03-20 09:17:38,983 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 48 66) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-03-20 09:17:38,983 INFO L878 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-03-20 09:17:38,983 INFO L882 garLoopResultBuilder]: For program point L51-1(line 51) no Hoare annotation was computed. [2022-03-20 09:17:38,983 INFO L878 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (= |main_#t~malloc13.offset| 0) (= |#memory_int| |old(#memory_int)|) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|)) [2022-03-20 09:17:38,983 INFO L882 garLoopResultBuilder]: For program point L52-1(line 52) no Hoare annotation was computed. [2022-03-20 09:17:38,983 INFO L878 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= |main_#t~malloc13.offset| 0) (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc13.base|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (= (select |#valid| main_~a~0.base) 1))) [2022-03-20 09:17:38,983 INFO L882 garLoopResultBuilder]: For program point L54-1(line 54) no Hoare annotation was computed. [2022-03-20 09:17:38,983 INFO L878 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (+ main_~a~0.base 1))) (and (= main_~a~0.offset 0) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#j~2.offset| 0) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~j~0 main_~n~0) (< mkdup_~i~0 main_~n~0) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (< .cse0 |main_~#i~2.base|) (= |main_~#i~2.offset| 0) (< .cse0 |main_~#j~2.base|) (not (= |main_~#i~2.base| |main_~#j~2.base|)))) [2022-03-20 09:17:38,983 INFO L882 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2022-03-20 09:17:38,984 INFO L878 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (let ((.cse5 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (.cse2 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (and (= main_~a~0.offset 0) (let ((.cse0 (<= (+ .cse5 1) main_~n~0)) (.cse1 (<= 1 .cse5)) (.cse3 (= main_~r~0 1)) (.cse4 (= |main_~#i~2.offset| 0))) (or (and .cse0 .cse1 (= 0 .cse2) .cse3 .cse4) (and (<= 1 .cse2) .cse0 (< (+ 1 .cse2) main_~n~0) .cse1 .cse3 .cse4))) (= |main_~#j~2.offset| 0) (let ((.cse6 (select |#memory_int| main_~a~0.base))) (= (select .cse6 (* 4 .cse2)) (select .cse6 (* .cse5 4)))) (not (= .cse5 .cse2)))) [2022-03-20 09:17:38,984 INFO L882 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2022-03-20 09:17:38,984 INFO L882 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2022-03-20 09:17:38,984 INFO L878 garLoopResultBuilder]: At program point L60-2(line 60) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (.cse1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (and (<= (+ .cse0 1) main_~n~0) (< (+ 1 .cse1) main_~n~0) (<= 1 .cse0) (= main_~a~0.offset 0) (= |main_~#j~2.offset| 0) (= |main_~#i~2.offset| 0) (let ((.cse2 (select |#memory_int| main_~a~0.base))) (= (select .cse2 (* 4 .cse1)) (select .cse2 (* .cse0 4)))) (not (= .cse0 .cse1)) |main_#t~short17|)) [2022-03-20 09:17:38,984 INFO L882 garLoopResultBuilder]: For program point L60-3(line 60) no Hoare annotation was computed. [2022-03-20 09:17:38,984 INFO L882 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-03-20 09:17:38,984 INFO L882 garLoopResultBuilder]: For program point L61-3(line 61) no Hoare annotation was computed. [2022-03-20 09:17:38,984 INFO L882 garLoopResultBuilder]: For program point L62-1(line 62) no Hoare annotation was computed. [2022-03-20 09:17:38,984 INFO L882 garLoopResultBuilder]: For program point L63-1(line 63) no Hoare annotation was computed. [2022-03-20 09:17:38,984 INFO L878 garLoopResultBuilder]: At program point L61-2(line 61) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (.cse2 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (and (<= (+ .cse0 1) main_~n~0) (<= 1 .cse0) (= main_~a~0.offset 0) (= |main_~#j~2.offset| 0) (= |main_~#i~2.offset| 0) (let ((.cse1 (select |#memory_int| main_~a~0.base))) (= (select .cse1 (* 4 .cse2)) (select .cse1 (* .cse0 4)))) (not (= .cse0 .cse2)) |main_#t~short20|)) [2022-03-20 09:17:38,984 INFO L878 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (.cse1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (and (= main_~a~0.offset 0) (<= 2 main_~n~0) (not (= |main_#t~mem22| |main_#t~mem21|)) (= |main_~#j~2.offset| 0) (= |main_~#i~2.offset| 0) (let ((.cse0 (select |#memory_int| main_~a~0.base))) (= (select .cse0 (* 4 .cse1)) (select .cse0 (* .cse2 4)))) (not (= .cse2 .cse1)))) [2022-03-20 09:17:38,984 INFO L878 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (<= 2 main_~n~0) (= |main_~#j~2.offset| 0) (= |main_#t~mem26| |main_#t~mem25|) (= |main_~#i~2.offset| 0) (not (= |main_~#i~2.base| |main_~#j~2.base|))) [2022-03-20 09:17:38,984 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 48 66) no Hoare annotation was computed. [2022-03-20 09:17:38,984 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 48 66) no Hoare annotation was computed. [2022-03-20 09:17:38,984 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 11) the Hoare annotation is: true [2022-03-20 09:17:38,984 INFO L882 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-03-20 09:17:38,984 INFO L882 garLoopResultBuilder]: For program point L10-1(line 10) no Hoare annotation was computed. [2022-03-20 09:17:38,984 INFO L882 garLoopResultBuilder]: For program point L10-3(lines 9 11) no Hoare annotation was computed. [2022-03-20 09:17:38,984 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2022-03-20 09:17:38,984 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 11) no Hoare annotation was computed. [2022-03-20 09:17:38,985 INFO L878 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (or (forall ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (or (not (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)) (not (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|)))) (= |#memory_int| |old(#memory_int)|)) [2022-03-20 09:17:38,985 INFO L882 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2022-03-20 09:17:38,985 INFO L882 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-03-20 09:17:38,987 INFO L719 BasicCegarLoop]: Path program histogram: [7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:17:38,988 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 09:17:38,992 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:259) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:342) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateSelect(Term2Expression.java:355) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:158) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:474) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:193) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-20 09:17:39,001 INFO L158 Benchmark]: Toolchain (without parser) took 625149.12ms. Allocated memory was 188.7MB in the beginning and 393.2MB in the end (delta: 204.5MB). Free memory was 136.6MB in the beginning and 164.9MB in the end (delta: -28.3MB). Peak memory consumption was 217.9MB. Max. memory is 8.0GB. [2022-03-20 09:17:39,001 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 188.7MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 09:17:39,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.27ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 136.4MB in the beginning and 201.5MB in the end (delta: -65.1MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. [2022-03-20 09:17:39,001 INFO L158 Benchmark]: Boogie Preprocessor took 41.46ms. Allocated memory is still 226.5MB. Free memory was 201.5MB in the beginning and 199.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-20 09:17:39,001 INFO L158 Benchmark]: RCFGBuilder took 298.72ms. Allocated memory is still 226.5MB. Free memory was 199.4MB in the beginning and 185.1MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-03-20 09:17:39,004 INFO L158 Benchmark]: IcfgTransformer took 16.89ms. Allocated memory is still 226.5MB. Free memory was 185.1MB in the beginning and 183.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 09:17:39,004 INFO L158 Benchmark]: TraceAbstraction took 624561.14ms. Allocated memory was 226.5MB in the beginning and 393.2MB in the end (delta: 166.7MB). Free memory was 183.0MB in the beginning and 164.9MB in the end (delta: 18.1MB). Peak memory consumption was 226.5MB. Max. memory is 8.0GB. [2022-03-20 09:17:39,005 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.14ms. Allocated memory is still 188.7MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.27ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 136.4MB in the beginning and 201.5MB in the end (delta: -65.1MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.46ms. Allocated memory is still 226.5MB. Free memory was 201.5MB in the beginning and 199.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 298.72ms. Allocated memory is still 226.5MB. Free memory was 199.4MB in the beginning and 185.1MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 16.89ms. Allocated memory is still 226.5MB. Free memory was 185.1MB in the beginning and 183.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 624561.14ms. Allocated memory was 226.5MB in the beginning and 393.2MB in the end (delta: 166.7MB). Free memory was 183.0MB in the beginning and 164.9MB in the end (delta: 18.1MB). Peak memory consumption was 226.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 624.5s, OverallIterations: 23, TraceHistogramMax: 8, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 280.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 121.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2244 SdHoareTripleChecker+Valid, 10.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2129 mSDsluCounter, 3435 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2383 IncrementalHoareTripleChecker+Unchecked, 2355 mSDsCounter, 1591 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16218 IncrementalHoareTripleChecker+Invalid, 20192 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1591 mSolverCounterUnsat, 1080 mSDtfsCounter, 16218 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3110 GetRequests, 2179 SyntacticMatches, 50 SemanticMatches, 881 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 15799 ImplicationChecksByTransitivity, 459.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=16, InterpolantAutomatonStates: 511, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 213 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 152 PreInvPairs, 223 NumberOfFragments, 3326 HoareAnnotationTreeSize, 152 FomulaSimplifications, 2246 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 88057 FormulaSimplificationTreeSizeReductionInter, 120.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 216.3s InterpolantComputationTime, 2726 NumberOfCodeBlocks, 2694 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 3351 ConstructedInterpolants, 160 QuantifiedInterpolants, 37741 SizeOfPredicates, 212 NumberOfNonLiveVariables, 4622 ConjunctsInSsa, 737 ConjunctsInUnsatCore, 50 InterpolantComputations, 9 PerfectInterpolantSequences, 2040/2875 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:259) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-20 09:17:39,223 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 09:17:39,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...