/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops/linear_search.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7968f31 [2022-03-17 19:20:19,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-17 19:20:19,547 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-17 19:20:19,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-17 19:20:19,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-17 19:20:19,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-17 19:20:19,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-17 19:20:19,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-17 19:20:19,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-17 19:20:19,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-17 19:20:19,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-17 19:20:19,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-17 19:20:19,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-17 19:20:19,611 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-17 19:20:19,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-17 19:20:19,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-17 19:20:19,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-17 19:20:19,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-17 19:20:19,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-17 19:20:19,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-17 19:20:19,623 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-17 19:20:19,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-17 19:20:19,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-17 19:20:19,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-17 19:20:19,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-17 19:20:19,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-17 19:20:19,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-17 19:20:19,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-17 19:20:19,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-17 19:20:19,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-17 19:20:19,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-17 19:20:19,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-17 19:20:19,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-17 19:20:19,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-17 19:20:19,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-17 19:20:19,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-17 19:20:19,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-17 19:20:19,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-17 19:20:19,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-17 19:20:19,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-17 19:20:19,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-17 19:20:19,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-17 19:20:19,650 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-03-17 19:20:19,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-17 19:20:19,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-17 19:20:19,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-17 19:20:19,686 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-17 19:20:19,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-17 19:20:19,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-17 19:20:19,688 INFO L138 SettingsManager]: * Use SBE=true [2022-03-17 19:20:19,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-17 19:20:19,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-17 19:20:19,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-17 19:20:19,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-17 19:20:19,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-17 19:20:19,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-17 19:20:19,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-17 19:20:19,690 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-17 19:20:19,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-17 19:20:19,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-17 19:20:19,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-17 19:20:19,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-17 19:20:19,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 19:20:19,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-17 19:20:19,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-17 19:20:19,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-17 19:20:19,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-17 19:20:19,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-17 19:20:19,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-17 19:20:19,691 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-03-17 19:20:19,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-03-17 19:20:19,693 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-17 19:20:19,693 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-17 19:20:19,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-17 19:20:19,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-17 19:20:19,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-17 19:20:19,924 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-17 19:20:19,926 INFO L275 PluginConnector]: CDTParser initialized [2022-03-17 19:20:19,928 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_search.c [2022-03-17 19:20:19,986 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f0e9b306/f02370ce12cb448e926042e79d8f2b3f/FLAGbe85344d8 [2022-03-17 19:20:20,315 INFO L306 CDTParser]: Found 1 translation units. [2022-03-17 19:20:20,315 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c [2022-03-17 19:20:20,321 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f0e9b306/f02370ce12cb448e926042e79d8f2b3f/FLAGbe85344d8 [2022-03-17 19:20:20,728 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f0e9b306/f02370ce12cb448e926042e79d8f2b3f [2022-03-17 19:20:20,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-17 19:20:20,732 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-17 19:20:20,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-17 19:20:20,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-17 19:20:20,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-17 19:20:20,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:20:20" (1/1) ... [2022-03-17 19:20:20,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@979b02b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:20, skipping insertion in model container [2022-03-17 19:20:20,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:20:20" (1/1) ... [2022-03-17 19:20:20,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-17 19:20:20,764 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-17 19:20:20,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c[383,396] [2022-03-17 19:20:20,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 19:20:20,992 INFO L203 MainTranslator]: Completed pre-run [2022-03-17 19:20:21,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c[383,396] [2022-03-17 19:20:21,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 19:20:21,040 INFO L208 MainTranslator]: Completed translation [2022-03-17 19:20:21,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:21 WrapperNode [2022-03-17 19:20:21,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-17 19:20:21,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-17 19:20:21,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-17 19:20:21,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-17 19:20:21,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:21" (1/1) ... [2022-03-17 19:20:21,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:21" (1/1) ... [2022-03-17 19:20:21,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:21" (1/1) ... [2022-03-17 19:20:21,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:21" (1/1) ... [2022-03-17 19:20:21,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:21" (1/1) ... [2022-03-17 19:20:21,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:21" (1/1) ... [2022-03-17 19:20:21,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:21" (1/1) ... [2022-03-17 19:20:21,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-17 19:20:21,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-17 19:20:21,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-17 19:20:21,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-17 19:20:21,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:21" (1/1) ... [2022-03-17 19:20:21,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 19:20:21,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 19:20:21,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-17 19:20:21,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-17 19:20:21,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-17 19:20:21,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-17 19:20:21,159 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-17 19:20:21,160 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-17 19:20:21,160 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2022-03-17 19:20:21,160 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-17 19:20:21,160 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-03-17 19:20:21,160 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-17 19:20:21,160 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-17 19:20:21,160 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-17 19:20:21,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-17 19:20:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-03-17 19:20:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-17 19:20:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-03-17 19:20:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2022-03-17 19:20:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-17 19:20:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-17 19:20:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-17 19:20:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-03-17 19:20:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-17 19:20:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-17 19:20:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-17 19:20:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-17 19:20:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-17 19:20:21,221 INFO L234 CfgBuilder]: Building ICFG [2022-03-17 19:20:21,223 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-17 19:20:21,392 INFO L275 CfgBuilder]: Performing block encoding [2022-03-17 19:20:21,397 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-17 19:20:21,397 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-17 19:20:21,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 07:20:21 BoogieIcfgContainer [2022-03-17 19:20:21,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-17 19:20:21,400 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-17 19:20:21,400 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-17 19:20:21,401 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-17 19:20:21,404 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 07:20:21" (1/1) ... [2022-03-17 19:20:21,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 07:20:21 BasicIcfg [2022-03-17 19:20:21,421 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-17 19:20:21,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-17 19:20:21,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-17 19:20:21,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-17 19:20:21,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:20:20" (1/4) ... [2022-03-17 19:20:21,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485e3e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:20:21, skipping insertion in model container [2022-03-17 19:20:21,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:21" (2/4) ... [2022-03-17 19:20:21,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485e3e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:20:21, skipping insertion in model container [2022-03-17 19:20:21,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 07:20:21" (3/4) ... [2022-03-17 19:20:21,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485e3e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 07:20:21, skipping insertion in model container [2022-03-17 19:20:21,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 07:20:21" (4/4) ... [2022-03-17 19:20:21,429 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_search.cqvasr [2022-03-17 19:20:21,434 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-17 19:20:21,434 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-17 19:20:21,489 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-17 19:20:21,502 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-17 19:20:21,502 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-17 19:20:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-03-17 19:20:21,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-17 19:20:21,523 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:20:21,523 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 19:20:21,524 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 19:20:21,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:20:21,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1395824931, now seen corresponding path program 1 times [2022-03-17 19:20:21,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:20:21,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960185061] [2022-03-17 19:20:21,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:20:21,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:20:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:21,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:20:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:21,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-17 19:20:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:21,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 19:20:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:20:21,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:20:21,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960185061] [2022-03-17 19:20:21,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960185061] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:20:21,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:20:21,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-17 19:20:21,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112391241] [2022-03-17 19:20:21,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:20:21,794 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-17 19:20:21,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:20:21,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-17 19:20:21,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-17 19:20:21,819 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-17 19:20:21,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:20:21,903 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-03-17 19:20:21,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 19:20:21,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-03-17 19:20:21,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:20:21,911 INFO L225 Difference]: With dead ends: 52 [2022-03-17 19:20:21,911 INFO L226 Difference]: Without dead ends: 27 [2022-03-17 19:20:21,915 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-17 19:20:21,920 INFO L912 BasicCegarLoop]: 33 mSDtfsCounter, 38 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 19:20:21,922 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 39 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 19:20:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-03-17 19:20:21,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-03-17 19:20:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-17 19:20:21,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-03-17 19:20:21,953 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-03-17 19:20:21,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:20:21,954 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-03-17 19:20:21,954 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-17 19:20:21,954 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-03-17 19:20:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-17 19:20:21,955 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:20:21,955 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 19:20:21,956 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-17 19:20:21,956 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 19:20:21,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:20:21,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1369163817, now seen corresponding path program 1 times [2022-03-17 19:20:21,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:20:21,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132262181] [2022-03-17 19:20:21,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:20:21,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:20:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:22,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:20:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:22,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-17 19:20:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:22,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 19:20:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:20:22,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:20:22,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132262181] [2022-03-17 19:20:22,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132262181] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:20:22,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:20:22,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-17 19:20:22,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831115204] [2022-03-17 19:20:22,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:20:22,129 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-17 19:20:22,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:20:22,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-17 19:20:22,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-03-17 19:20:22,130 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-17 19:20:22,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:20:22,279 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-03-17 19:20:22,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 19:20:22,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-03-17 19:20:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:20:22,286 INFO L225 Difference]: With dead ends: 35 [2022-03-17 19:20:22,286 INFO L226 Difference]: Without dead ends: 27 [2022-03-17 19:20:22,288 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-03-17 19:20:22,289 INFO L912 BasicCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 19:20:22,290 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 50 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 19:20:22,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-03-17 19:20:22,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-03-17 19:20:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-17 19:20:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-03-17 19:20:22,302 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2022-03-17 19:20:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:20:22,302 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-03-17 19:20:22,303 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-17 19:20:22,303 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-03-17 19:20:22,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-17 19:20:22,304 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:20:22,304 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 19:20:22,305 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-17 19:20:22,305 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 19:20:22,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:20:22,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1182993144, now seen corresponding path program 1 times [2022-03-17 19:20:22,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:20:22,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603321484] [2022-03-17 19:20:22,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:20:22,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:20:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:22,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:20:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:22,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-17 19:20:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:22,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 19:20:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:20:22,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:20:22,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603321484] [2022-03-17 19:20:22,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603321484] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:20:22,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:20:22,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-17 19:20:22,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770741471] [2022-03-17 19:20:22,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:20:22,525 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-17 19:20:22,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:20:22,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-17 19:20:22,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-03-17 19:20:22,526 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-17 19:20:24,633 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-17 19:20:24,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:20:24,956 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-03-17 19:20:24,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-17 19:20:24,957 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-03-17 19:20:24,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:20:24,958 INFO L225 Difference]: With dead ends: 40 [2022-03-17 19:20:24,958 INFO L226 Difference]: Without dead ends: 31 [2022-03-17 19:20:24,958 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-03-17 19:20:24,959 INFO L912 BasicCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-17 19:20:24,960 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 38 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 89 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-03-17 19:20:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-03-17 19:20:24,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-03-17 19:20:24,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-17 19:20:24,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-03-17 19:20:24,967 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2022-03-17 19:20:24,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:20:24,967 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-03-17 19:20:24,967 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-17 19:20:24,968 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-03-17 19:20:24,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-17 19:20:24,968 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:20:24,968 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 19:20:24,968 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-17 19:20:24,969 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 19:20:24,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:20:24,969 INFO L85 PathProgramCache]: Analyzing trace with hash -503218689, now seen corresponding path program 1 times [2022-03-17 19:20:24,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:20:24,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718752613] [2022-03-17 19:20:24,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:20:24,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:20:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:25,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:20:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:25,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-17 19:20:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:25,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 19:20:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:20:25,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:20:25,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718752613] [2022-03-17 19:20:25,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718752613] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:20:25,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:20:25,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 19:20:25,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752002658] [2022-03-17 19:20:25,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:20:25,104 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 19:20:25,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:20:25,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 19:20:25,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-17 19:20:25,105 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-17 19:20:25,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:20:25,348 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-03-17 19:20:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 19:20:25,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-03-17 19:20:25,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:20:25,351 INFO L225 Difference]: With dead ends: 50 [2022-03-17 19:20:25,351 INFO L226 Difference]: Without dead ends: 37 [2022-03-17 19:20:25,351 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-03-17 19:20:25,352 INFO L912 BasicCegarLoop]: 22 mSDtfsCounter, 61 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 19:20:25,353 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 31 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-17 19:20:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-03-17 19:20:25,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-03-17 19:20:25,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-17 19:20:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-03-17 19:20:25,360 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 29 [2022-03-17 19:20:25,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:20:25,360 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-03-17 19:20:25,361 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-17 19:20:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-03-17 19:20:25,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-17 19:20:25,361 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:20:25,362 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 19:20:25,362 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-17 19:20:25,362 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 19:20:25,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:20:25,362 INFO L85 PathProgramCache]: Analyzing trace with hash -374135970, now seen corresponding path program 1 times [2022-03-17 19:20:25,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:20:25,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332650837] [2022-03-17 19:20:25,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:20:25,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:20:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:25,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:20:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:25,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-17 19:20:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:25,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 19:20:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:20:25,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:20:25,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332650837] [2022-03-17 19:20:25,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332650837] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 19:20:25,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801510591] [2022-03-17 19:20:25,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:20:25,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 19:20:25,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 19:20:25,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 19:20:25,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-17 19:20:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:20:25,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-17 19:20:25,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 19:20:25,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-03-17 19:20:26,052 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 28 treesize of output 23 [2022-03-17 19:20:32,469 WARN L833 $PredicateComparison]: unable to prove that (and (< 1 (mod c_~SIZE~0 4294967296)) (exists ((v_ArrVal_38 Int)) (= (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) c_main_~a~0.offset) v_ArrVal_38) (select |c_#memory_int| c_main_~a~0.base)))) is different from false [2022-03-17 19:20:38,907 WARN L833 $PredicateComparison]: unable to prove that (and (< 1 (mod c_~SIZE~0 4294967296)) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38)))) is different from false [2022-03-17 19:20:45,355 WARN L833 $PredicateComparison]: unable to prove that (and (< 1 (mod c_~SIZE~0 4294967296)) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (<= |c_linear_search_#in~a.offset| c_linear_search_~a.offset)) is different from false [2022-03-17 19:21:13,364 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((linear_search_~a.offset Int)) (and (<= |c_linear_search_#in~a.offset| linear_search_~a.offset) (let ((.cse0 (= (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* (mod c_linear_search_~j~0 4294967296) 4) linear_search_~a.offset)) |c_linear_search_#in~q|))) (or (and .cse0 (not |c_linear_search_#t~short5|)) (and (not .cse0) |c_linear_search_#t~short5|))))) (< 1 (mod c_~SIZE~0 4294967296)) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38)))) is different from false [2022-03-17 19:21:19,821 WARN L833 $PredicateComparison]: unable to prove that (and (< 1 (mod c_~SIZE~0 4294967296)) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (exists ((linear_search_~a.offset Int)) (and (<= |c_linear_search_#in~a.offset| linear_search_~a.offset) (= (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* (mod c_linear_search_~j~0 4294967296) 4) linear_search_~a.offset)) |c_linear_search_#in~q|)))) is different from false [2022-03-17 19:21:26,339 WARN L833 $PredicateComparison]: unable to prove that (and (< 1 (mod c_~SIZE~0 4294967296)) (exists ((aux_mod_linear_search_~j~0_35 Int) (linear_search_~a.offset Int)) (and (<= (mod c_~SIZE~0 4294967296) aux_mod_linear_search_~j~0_35) (<= |c_linear_search_#in~a.offset| linear_search_~a.offset) (< aux_mod_linear_search_~j~0_35 4294967296) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* (mod aux_mod_linear_search_~j~0_35 4294967296) 4) linear_search_~a.offset))))) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38)))) is different from false [2022-03-17 19:21:45,515 WARN L232 SmtUtils]: Spent 12.66s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-03-17 19:21:45,515 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-17 19:21:45,515 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 52 treesize of output 54 [2022-03-17 19:23:14,294 WARN L232 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-03-17 19:24:37,842 WARN L833 $PredicateComparison]: unable to prove that (exists ((aux_mod_linear_search_~j~0_35 Int) (aux_div_aux_mod_~SIZE~0_24_35 Int) (aux_mod_aux_mod_~SIZE~0_24_35 Int) (v_ArrVal_38 Int) (main_~a~0.offset Int) (linear_search_~a.offset Int)) (let ((.cse0 (+ aux_mod_aux_mod_~SIZE~0_24_35 (* 4294967296 aux_div_aux_mod_~SIZE~0_24_35)))) (and (<= 0 .cse0) (= 3 (select (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* 4 (mod (div (mod aux_mod_aux_mod_~SIZE~0_24_35 4294967296) 2) 4294967296))) v_ArrVal_38) (+ (* (mod aux_mod_linear_search_~j~0_35 4294967296) 4) linear_search_~a.offset))) (< aux_mod_linear_search_~j~0_35 4294967296) (< aux_mod_aux_mod_~SIZE~0_24_35 4294967296) (<= main_~a~0.offset linear_search_~a.offset) (< 1 aux_mod_aux_mod_~SIZE~0_24_35) (<= .cse0 aux_mod_linear_search_~j~0_35)))) is different from false [2022-03-17 19:25:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-03-17 19:25:09,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 19:25:09,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801510591] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 19:25:09,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 19:25:09,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2022-03-17 19:25:09,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492769430] [2022-03-17 19:25:09,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 19:25:09,876 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-17 19:25:09,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:25:09,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-17 19:25:09,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=238, Unknown=7, NotChecked=252, Total=552 [2022-03-17 19:25:09,877 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 18 states have internal predecessors, (38), 6 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-03-17 19:25:12,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-17 19:25:14,489 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* (div c_~SIZE~0 4294967296) 4294967296))) (and (< 1 (mod c_~SIZE~0 4294967296)) (<= c_~SIZE~0 (+ .cse0 99999)) (<= (+ 2 .cse0) c_~SIZE~0) (exists ((v_ArrVal_38 Int)) (= (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) c_main_~a~0.offset) v_ArrVal_38) (select |c_#memory_int| c_main_~a~0.base))))) is different from false [2022-03-17 19:25:16,643 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 c_linear_search_~j~0) (< 1 (mod c_~SIZE~0 4294967296)) (<= c_linear_search_~j~0 0) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (<= |c_linear_search_#in~a.offset| c_linear_search_~a.offset)) is different from false [2022-03-17 19:25:18,784 WARN L833 $PredicateComparison]: unable to prove that (and (< 1 (mod c_~SIZE~0 4294967296)) (<= c_linear_search_~j~0 0) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (<= |c_linear_search_#in~a.offset| c_linear_search_~a.offset) (<= c_linear_search_~n (+ c_linear_search_~j~0 4294967295 (* (div c_linear_search_~n 4294967296) 4294967296)))) is different from false [2022-03-17 19:25:20,935 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((linear_search_~a.offset Int)) (and (<= |c_linear_search_#in~a.offset| linear_search_~a.offset) (let ((.cse0 (= (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* (mod c_linear_search_~j~0 4294967296) 4) linear_search_~a.offset)) |c_linear_search_#in~q|))) (or (and .cse0 (not |c_linear_search_#t~short5|)) (and (not .cse0) |c_linear_search_#t~short5|))))) (< 1 (mod c_~SIZE~0 4294967296)) (<= c_linear_search_~j~0 0) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (<= |c_linear_search_#in~a.offset| c_linear_search_~a.offset) (<= c_linear_search_~n (+ c_linear_search_~j~0 4294967295 (* (div c_linear_search_~n 4294967296) 4294967296)))) is different from false [2022-03-17 19:25:23,100 WARN L833 $PredicateComparison]: unable to prove that (and (< 1 (mod c_~SIZE~0 4294967296)) (<= c_linear_search_~j~0 1) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (<= |c_linear_search_#in~a.offset| c_linear_search_~a.offset) (or (not (<= (+ (div c_linear_search_~j~0 4294967296) 1) 0)) (<= c_linear_search_~n (+ c_linear_search_~j~0 4294967294 (* (div c_linear_search_~n 4294967296) 4294967296))))) is different from false [2022-03-17 19:25:25,249 WARN L833 $PredicateComparison]: unable to prove that (and (or (< 0 (+ (div c_linear_search_~j~0 4294967296) 1)) (not |c_linear_search_#t~short5|)) (< 1 (mod c_~SIZE~0 4294967296)) (<= c_linear_search_~j~0 1) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (<= |c_linear_search_#in~a.offset| c_linear_search_~a.offset)) is different from false [2022-03-17 19:25:27,390 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((linear_search_~a.offset Int)) (and (<= |c_linear_search_#in~a.offset| linear_search_~a.offset) (let ((.cse0 (= (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* (mod c_linear_search_~j~0 4294967296) 4) linear_search_~a.offset)) |c_linear_search_#in~q|))) (or (and .cse0 (not |c_linear_search_#t~short5|)) (and (not .cse0) |c_linear_search_#t~short5|))))) (< 0 (+ (div c_linear_search_~j~0 4294967296) 1)) (< 1 (mod c_~SIZE~0 4294967296)) (<= c_linear_search_~j~0 1) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (<= |c_linear_search_#in~a.offset| c_linear_search_~a.offset)) is different from false [2022-03-17 19:25:29,537 WARN L833 $PredicateComparison]: unable to prove that (and (< 0 (+ (div c_linear_search_~j~0 4294967296) 1)) (< 1 (mod c_~SIZE~0 4294967296)) (<= c_linear_search_~j~0 1) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (exists ((linear_search_~a.offset Int)) (and (<= |c_linear_search_#in~a.offset| linear_search_~a.offset) (= (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* (mod c_linear_search_~j~0 4294967296) 4) linear_search_~a.offset)) |c_linear_search_#in~q|)))) is different from false [2022-03-17 19:25:31,691 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((linear_search_~a.offset Int)) (and (<= |c_linear_search_#in~a.offset| linear_search_~a.offset) (let ((.cse0 (= (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* (mod c_linear_search_~j~0 4294967296) 4) linear_search_~a.offset)) |c_linear_search_#in~q|))) (or (and .cse0 (not |c_linear_search_#t~short5|)) (and (not .cse0) |c_linear_search_#t~short5|))))) (< 1 (mod c_~SIZE~0 4294967296)) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (<= |c_linear_search_#in~a.offset| c_linear_search_~a.offset)) is different from false [2022-03-17 19:25:33,848 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< 1 (mod c_~SIZE~0 4294967296)) (= |c_old(#memory_int)| |c_#memory_int|) (exists ((aux_mod_linear_search_~j~0_35 Int) (linear_search_~a.offset Int)) (and (<= (mod c_~SIZE~0 4294967296) aux_mod_linear_search_~j~0_35) (<= |c_linear_search_#in~a.offset| linear_search_~a.offset) (< aux_mod_linear_search_~j~0_35 4294967296) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* (mod aux_mod_linear_search_~j~0_35 4294967296) 4) linear_search_~a.offset))))) (= c_~MAX~0 |c_old(~MAX~0)|) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(~SIZE~0)| c_~SIZE~0)) is different from false [2022-03-17 19:25:33,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:25:33,882 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2022-03-17 19:25:33,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-17 19:25:33,882 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 18 states have internal predecessors, (38), 6 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2022-03-17 19:25:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:25:33,884 INFO L225 Difference]: With dead ends: 53 [2022-03-17 19:25:33,884 INFO L226 Difference]: Without dead ends: 40 [2022-03-17 19:25:33,885 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=142, Invalid=559, Unknown=17, NotChecked=1088, Total=1806 [2022-03-17 19:25:33,886 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-17 19:25:33,886 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 92 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 105 Invalid, 1 Unknown, 121 Unchecked, 2.1s Time] [2022-03-17 19:25:33,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-03-17 19:25:33,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-03-17 19:25:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-17 19:25:33,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-03-17 19:25:33,901 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 29 [2022-03-17 19:25:33,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:25:33,901 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-03-17 19:25:33,901 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 18 states have internal predecessors, (38), 6 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-03-17 19:25:33,901 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-03-17 19:25:33,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-17 19:25:33,902 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:25:33,902 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 19:25:33,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-17 19:25:34,103 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 19:25:34,103 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 19:25:34,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:25:34,104 INFO L85 PathProgramCache]: Analyzing trace with hash -570649475, now seen corresponding path program 1 times [2022-03-17 19:25:34,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:25:34,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618906513] [2022-03-17 19:25:34,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:25:34,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:25:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:25:34,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:25:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:25:34,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-17 19:25:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:25:34,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-17 19:25:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:25:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:25:34,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:25:34,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618906513] [2022-03-17 19:25:34,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618906513] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 19:25:34,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527713729] [2022-03-17 19:25:34,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:25:34,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 19:25:34,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 19:25:34,320 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 19:25:34,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process